/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.25-d9e330d [2020-02-10 20:12:01,238 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-02-10 20:12:01,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-02-10 20:12:01,259 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-02-10 20:12:01,259 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-02-10 20:12:01,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-02-10 20:12:01,261 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-02-10 20:12:01,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-02-10 20:12:01,265 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-02-10 20:12:01,266 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-02-10 20:12:01,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-02-10 20:12:01,268 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-02-10 20:12:01,268 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-02-10 20:12:01,269 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-02-10 20:12:01,270 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-02-10 20:12:01,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-02-10 20:12:01,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-02-10 20:12:01,273 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-02-10 20:12:01,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-02-10 20:12:01,276 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-02-10 20:12:01,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-02-10 20:12:01,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-02-10 20:12:01,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-02-10 20:12:01,280 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-02-10 20:12:01,282 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-02-10 20:12:01,282 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-02-10 20:12:01,282 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-02-10 20:12:01,283 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-02-10 20:12:01,284 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-02-10 20:12:01,284 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-02-10 20:12:01,285 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-02-10 20:12:01,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-02-10 20:12:01,289 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-02-10 20:12:01,290 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-02-10 20:12:01,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-02-10 20:12:01,291 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-02-10 20:12:01,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-02-10 20:12:01,292 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-02-10 20:12:01,292 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-02-10 20:12:01,293 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-02-10 20:12:01,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-02-10 20:12:01,294 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2020-02-10 20:12:01,308 INFO L113 SettingsManager]: Loading preferences was successful [2020-02-10 20:12:01,308 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-02-10 20:12:01,309 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-02-10 20:12:01,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-02-10 20:12:01,310 INFO L138 SettingsManager]: * Use SBE=true [2020-02-10 20:12:01,310 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-02-10 20:12:01,310 INFO L138 SettingsManager]: * sizeof long=4 [2020-02-10 20:12:01,310 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-02-10 20:12:01,311 INFO L138 SettingsManager]: * sizeof long double=12 [2020-02-10 20:12:01,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-02-10 20:12:01,312 INFO L138 SettingsManager]: * Use constant arrays=true [2020-02-10 20:12:01,312 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-02-10 20:12:01,312 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-02-10 20:12:01,312 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-02-10 20:12:01,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-02-10 20:12:01,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-02-10 20:12:01,313 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:01,313 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-02-10 20:12:01,313 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-02-10 20:12:01,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-02-10 20:12:01,314 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-02-10 20:12:01,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-02-10 20:12:01,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-02-10 20:12:01,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-02-10 20:12:01,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-02-10 20:12:01,601 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-02-10 20:12:01,604 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-02-10 20:12:01,606 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2020-02-10 20:12:01,606 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2020-02-10 20:12:01,607 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl [2020-02-10 20:12:01,607 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/bpl/mcr/example_8.bpl' [2020-02-10 20:12:01,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-02-10 20:12:01,643 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-02-10 20:12:01,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-02-10 20:12:01,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-02-10 20:12:01,660 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,670 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-02-10 20:12:01,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-02-10 20:12:01,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-02-10 20:12:01,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,692 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,693 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,698 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,699 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... [2020-02-10 20:12:01,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-02-10 20:12:01,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-02-10 20:12:01,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-02-10 20:12:01,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-02-10 20:12:01,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-02-10 20:12:01,772 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_1 given in one single declaration [2020-02-10 20:12:01,772 INFO L130 BoogieDeclarations]: Found specification of procedure set_1 [2020-02-10 20:12:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1 [2020-02-10 20:12:01,773 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_2 given in one single declaration [2020-02-10 20:12:01,773 INFO L130 BoogieDeclarations]: Found specification of procedure set_2 [2020-02-10 20:12:01,773 INFO L138 BoogieDeclarations]: Found implementation of procedure set_2 [2020-02-10 20:12:01,774 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_3 given in one single declaration [2020-02-10 20:12:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure set_3 [2020-02-10 20:12:01,774 INFO L138 BoogieDeclarations]: Found implementation of procedure set_3 [2020-02-10 20:12:01,774 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_4 given in one single declaration [2020-02-10 20:12:01,774 INFO L130 BoogieDeclarations]: Found specification of procedure set_4 [2020-02-10 20:12:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure set_4 [2020-02-10 20:12:01,775 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_0 given in one single declaration [2020-02-10 20:12:01,775 INFO L130 BoogieDeclarations]: Found specification of procedure set_0 [2020-02-10 20:12:01,775 INFO L138 BoogieDeclarations]: Found implementation of procedure set_0 [2020-02-10 20:12:01,775 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2020-02-10 20:12:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-02-10 20:12:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-02-10 20:12:01,776 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_5 given in one single declaration [2020-02-10 20:12:01,776 INFO L130 BoogieDeclarations]: Found specification of procedure set_5 [2020-02-10 20:12:01,776 INFO L138 BoogieDeclarations]: Found implementation of procedure set_5 [2020-02-10 20:12:01,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_6 given in one single declaration [2020-02-10 20:12:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure set_6 [2020-02-10 20:12:01,777 INFO L138 BoogieDeclarations]: Found implementation of procedure set_6 [2020-02-10 20:12:01,777 INFO L124 BoogieDeclarations]: Specification and implementation of procedure set_7 given in one single declaration [2020-02-10 20:12:01,777 INFO L130 BoogieDeclarations]: Found specification of procedure set_7 [2020-02-10 20:12:01,778 INFO L138 BoogieDeclarations]: Found implementation of procedure set_7 [2020-02-10 20:12:01,779 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-02-10 20:12:02,062 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-02-10 20:12:02,063 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-02-10 20:12:02,067 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:02 BoogieIcfgContainer [2020-02-10 20:12:02,067 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-02-10 20:12:02,068 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-02-10 20:12:02,068 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-02-10 20:12:02,071 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-02-10 20:12:02,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.02 08:12:01" (1/2) ... [2020-02-10 20:12:02,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6efdfd69 and model type example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.02 08:12:02, skipping insertion in model container [2020-02-10 20:12:02,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.02 08:12:02" (2/2) ... [2020-02-10 20:12:02,076 INFO L109 eAbstractionObserver]: Analyzing ICFG example_8.bpl [2020-02-10 20:12:02,088 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-02-10 20:12:02,089 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-02-10 20:12:02,097 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-02-10 20:12:02,099 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-02-10 20:12:02,319 INFO L251 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2020-02-10 20:12:02,338 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-02-10 20:12:02,338 INFO L376 AbstractCegarLoop]: Hoare is true [2020-02-10 20:12:02,339 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-02-10 20:12:02,339 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-02-10 20:12:02,339 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-02-10 20:12:02,339 INFO L380 AbstractCegarLoop]: Difference is false [2020-02-10 20:12:02,339 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-02-10 20:12:02,339 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-02-10 20:12:02,354 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 68 places, 99 transitions [2020-02-10 20:12:02,356 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 20:12:02,750 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 20:12:02,751 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 20:12:02,770 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-02-10 20:12:02,795 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 68 places, 99 transitions [2020-02-10 20:12:03,033 INFO L129 PetriNetUnfolder]: 769/1051 cut-off events. [2020-02-10 20:12:03,033 INFO L130 PetriNetUnfolder]: For 1024/1024 co-relation queries the response was YES. [2020-02-10 20:12:03,042 INFO L76 FinitePrefix]: Finished finitePrefix Result has 2100 conditions, 1051 events. 769/1051 cut-off events. For 1024/1024 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 3864 event pairs. 0/1050 useless extension candidates. Maximal degree in co-relation 933. Up to 280 conditions per place. [2020-02-10 20:12:03,066 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 1904 [2020-02-10 20:12:03,067 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-02-10 20:12:03,303 INFO L206 etLargeBlockEncoding]: Checked pairs total: 532 [2020-02-10 20:12:03,303 INFO L214 etLargeBlockEncoding]: Total number of compositions: 9 [2020-02-10 20:12:03,309 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 59 places, 90 transitions [2020-02-10 20:12:04,192 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6818 states. [2020-02-10 20:12:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 6818 states. [2020-02-10 20:12:04,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:04,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:04,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, 1, 1, 1] [2020-02-10 20:12:04,273 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:04,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:04,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1176015965, now seen corresponding path program 1 times [2020-02-10 20:12:04,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:04,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354049421] [2020-02-10 20:12:04,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:04,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 20:12:04,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354049421] [2020-02-10 20:12:04,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:04,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:04,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802118861] [2020-02-10 20:12:04,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:04,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:04,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:04,488 INFO L87 Difference]: Start difference. First operand 6818 states. Second operand 3 states. [2020-02-10 20:12:04,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:04,723 INFO L93 Difference]: Finished difference Result 6690 states and 34994 transitions. [2020-02-10 20:12:04,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:04,726 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:04,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:04,866 INFO L225 Difference]: With dead ends: 6690 [2020-02-10 20:12:04,866 INFO L226 Difference]: Without dead ends: 6689 [2020-02-10 20:12:04,869 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:05,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6689 states. [2020-02-10 20:12:05,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6689 to 6689. [2020-02-10 20:12:05,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6689 states. [2020-02-10 20:12:05,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6689 states to 6689 states and 34993 transitions. [2020-02-10 20:12:05,855 INFO L78 Accepts]: Start accepts. Automaton has 6689 states and 34993 transitions. Word has length 25 [2020-02-10 20:12:05,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:05,857 INFO L479 AbstractCegarLoop]: Abstraction has 6689 states and 34993 transitions. [2020-02-10 20:12:05,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 6689 states and 34993 transitions. [2020-02-10 20:12:05,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:05,887 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:05,887 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:05,888 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:05,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 1467806563, now seen corresponding path program 1 times [2020-02-10 20:12:05,888 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:05,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608301566] [2020-02-10 20:12:05,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:05,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:05,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 20:12:05,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608301566] [2020-02-10 20:12:05,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:05,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:05,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130826285] [2020-02-10 20:12:05,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:05,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:05,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:05,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:05,975 INFO L87 Difference]: Start difference. First operand 6689 states and 34993 transitions. Second operand 3 states. [2020-02-10 20:12:06,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,133 INFO L93 Difference]: Finished difference Result 4881 states and 24065 transitions. [2020-02-10 20:12:06,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:06,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:06,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,206 INFO L225 Difference]: With dead ends: 4881 [2020-02-10 20:12:06,206 INFO L226 Difference]: Without dead ends: 4881 [2020-02-10 20:12:06,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:06,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4881 states. [2020-02-10 20:12:06,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4881 to 4881. [2020-02-10 20:12:06,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4881 states. [2020-02-10 20:12:06,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4881 states to 4881 states and 24065 transitions. [2020-02-10 20:12:06,475 INFO L78 Accepts]: Start accepts. Automaton has 4881 states and 24065 transitions. Word has length 25 [2020-02-10 20:12:06,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,476 INFO L479 AbstractCegarLoop]: Abstraction has 4881 states and 24065 transitions. [2020-02-10 20:12:06,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:06,476 INFO L276 IsEmpty]: Start isEmpty. Operand 4881 states and 24065 transitions. [2020-02-10 20:12:06,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:06,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,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, 1, 1, 1] [2020-02-10 20:12:06,505 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,506 INFO L82 PathProgramCache]: Analyzing trace with hash -795426887, now seen corresponding path program 1 times [2020-02-10 20:12:06,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208610811] [2020-02-10 20:12:06,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:06,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 20:12:06,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208610811] [2020-02-10 20:12:06,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:06,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:06,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135415224] [2020-02-10 20:12:06,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:06,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:06,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:06,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:06,563 INFO L87 Difference]: Start difference. First operand 4881 states and 24065 transitions. Second operand 3 states. [2020-02-10 20:12:06,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:06,651 INFO L93 Difference]: Finished difference Result 3205 states and 15221 transitions. [2020-02-10 20:12:06,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:06,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:06,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:06,670 INFO L225 Difference]: With dead ends: 3205 [2020-02-10 20:12:06,671 INFO L226 Difference]: Without dead ends: 3205 [2020-02-10 20:12:06,671 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3205 states. [2020-02-10 20:12:06,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3205 to 3205. [2020-02-10 20:12:06,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3205 states. [2020-02-10 20:12:06,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3205 states to 3205 states and 15221 transitions. [2020-02-10 20:12:06,978 INFO L78 Accepts]: Start accepts. Automaton has 3205 states and 15221 transitions. Word has length 25 [2020-02-10 20:12:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:06,978 INFO L479 AbstractCegarLoop]: Abstraction has 3205 states and 15221 transitions. [2020-02-10 20:12:06,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:06,979 INFO L276 IsEmpty]: Start isEmpty. Operand 3205 states and 15221 transitions. [2020-02-10 20:12:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:06,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:06,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, 1, 1, 1] [2020-02-10 20:12:06,997 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:06,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash 694354523, now seen corresponding path program 1 times [2020-02-10 20:12:06,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:06,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116399271] [2020-02-10 20:12:06,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116399271] [2020-02-10 20:12:07,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:07,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797234708] [2020-02-10 20:12:07,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:07,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:07,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,062 INFO L87 Difference]: Start difference. First operand 3205 states and 15221 transitions. Second operand 3 states. [2020-02-10 20:12:07,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,156 INFO L93 Difference]: Finished difference Result 2757 states and 12469 transitions. [2020-02-10 20:12:07,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:07,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:07,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,170 INFO L225 Difference]: With dead ends: 2757 [2020-02-10 20:12:07,171 INFO L226 Difference]: Without dead ends: 2757 [2020-02-10 20:12:07,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2757 states. [2020-02-10 20:12:07,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2757 to 2757. [2020-02-10 20:12:07,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2757 states. [2020-02-10 20:12:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2757 states to 2757 states and 12469 transitions. [2020-02-10 20:12:07,303 INFO L78 Accepts]: Start accepts. Automaton has 2757 states and 12469 transitions. Word has length 25 [2020-02-10 20:12:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,303 INFO L479 AbstractCegarLoop]: Abstraction has 2757 states and 12469 transitions. [2020-02-10 20:12:07,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:07,303 INFO L276 IsEmpty]: Start isEmpty. Operand 2757 states and 12469 transitions. [2020-02-10 20:12:07,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:07,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,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, 1, 1, 1] [2020-02-10 20:12:07,317 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1749585931, now seen corresponding path program 1 times [2020-02-10 20:12:07,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576931490] [2020-02-10 20:12:07,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576931490] [2020-02-10 20:12:07,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:07,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819021198] [2020-02-10 20:12:07,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:07,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:07,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,384 INFO L87 Difference]: Start difference. First operand 2757 states and 12469 transitions. Second operand 3 states. [2020-02-10 20:12:07,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,438 INFO L93 Difference]: Finished difference Result 1773 states and 7633 transitions. [2020-02-10 20:12:07,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:07,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:07,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,449 INFO L225 Difference]: With dead ends: 1773 [2020-02-10 20:12:07,450 INFO L226 Difference]: Without dead ends: 1773 [2020-02-10 20:12:07,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2020-02-10 20:12:07,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2020-02-10 20:12:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2020-02-10 20:12:07,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 7633 transitions. [2020-02-10 20:12:07,542 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 7633 transitions. Word has length 25 [2020-02-10 20:12:07,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,542 INFO L479 AbstractCegarLoop]: Abstraction has 1773 states and 7633 transitions. [2020-02-10 20:12:07,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 7633 transitions. [2020-02-10 20:12:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:07,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,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, 1, 1, 1] [2020-02-10 20:12:07,550 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1906045009, now seen corresponding path program 1 times [2020-02-10 20:12:07,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014043965] [2020-02-10 20:12:07,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,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 20:12:07,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014043965] [2020-02-10 20:12:07,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:07,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807623158] [2020-02-10 20:12:07,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:07,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:07,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,600 INFO L87 Difference]: Start difference. First operand 1773 states and 7633 transitions. Second operand 3 states. [2020-02-10 20:12:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,623 INFO L93 Difference]: Finished difference Result 1119 states and 4673 transitions. [2020-02-10 20:12:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:07,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,630 INFO L225 Difference]: With dead ends: 1119 [2020-02-10 20:12:07,632 INFO L226 Difference]: Without dead ends: 1119 [2020-02-10 20:12:07,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1119 states. [2020-02-10 20:12:07,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1119 to 1119. [2020-02-10 20:12:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1119 states. [2020-02-10 20:12:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1119 states to 1119 states and 4673 transitions. [2020-02-10 20:12:07,695 INFO L78 Accepts]: Start accepts. Automaton has 1119 states and 4673 transitions. Word has length 25 [2020-02-10 20:12:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,695 INFO L479 AbstractCegarLoop]: Abstraction has 1119 states and 4673 transitions. [2020-02-10 20:12:07,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1119 states and 4673 transitions. [2020-02-10 20:12:07,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:07,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,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, 1, 1, 1] [2020-02-10 20:12:07,703 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,703 INFO L82 PathProgramCache]: Analyzing trace with hash -389208845, now seen corresponding path program 1 times [2020-02-10 20:12:07,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836243447] [2020-02-10 20:12:07,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:07,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:07,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836243447] [2020-02-10 20:12:07,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:07,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-02-10 20:12:07,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757747256] [2020-02-10 20:12:07,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-02-10 20:12:07,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:07,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-02-10 20:12:07,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,751 INFO L87 Difference]: Start difference. First operand 1119 states and 4673 transitions. Second operand 3 states. [2020-02-10 20:12:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:07,763 INFO L93 Difference]: Finished difference Result 767 states and 3073 transitions. [2020-02-10 20:12:07,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:12:07,763 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-02-10 20:12:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:07,767 INFO L225 Difference]: With dead ends: 767 [2020-02-10 20:12:07,767 INFO L226 Difference]: Without dead ends: 767 [2020-02-10 20:12:07,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-02-10 20:12:07,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 767 states. [2020-02-10 20:12:07,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 767 to 767. [2020-02-10 20:12:07,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 20:12:07,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3073 transitions. [2020-02-10 20:12:07,805 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3073 transitions. Word has length 25 [2020-02-10 20:12:07,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:07,807 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3073 transitions. [2020-02-10 20:12:07,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-02-10 20:12:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3073 transitions. [2020-02-10 20:12:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:07,810 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:07,810 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:07,810 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:07,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:07,811 INFO L82 PathProgramCache]: Analyzing trace with hash -377910571, now seen corresponding path program 1 times [2020-02-10 20:12:07,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:07,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240141540] [2020-02-10 20:12:07,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:08,485 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:12:08,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:08,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240141540] [2020-02-10 20:12:08,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:08,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:08,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601009640] [2020-02-10 20:12:08,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:08,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:08,496 INFO L87 Difference]: Start difference. First operand 767 states and 3073 transitions. Second operand 10 states. [2020-02-10 20:12:08,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:08,704 INFO L93 Difference]: Finished difference Result 1367 states and 4850 transitions. [2020-02-10 20:12:08,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:08,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:08,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:08,710 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:12:08,710 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:12:08,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:08,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:12:08,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 20:12:08,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:08,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 20:12:08,762 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 20:12:08,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:08,763 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 20:12:08,763 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:08,763 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 20:12:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:08,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:08,766 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:08,766 INFO L427 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 592341043, now seen corresponding path program 2 times [2020-02-10 20:12:08,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:08,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599027747] [2020-02-10 20:12:08,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:09,196 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2020-02-10 20:12:09,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 20:12:09,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599027747] [2020-02-10 20:12:09,399 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:09,399 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:09,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672776141] [2020-02-10 20:12:09,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:09,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:09,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:09,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:09,401 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:12:09,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:09,574 INFO L93 Difference]: Finished difference Result 1369 states and 4850 transitions. [2020-02-10 20:12:09,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:09,575 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:09,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:09,583 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:12:09,584 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:09,585 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:09,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:09,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:12:09,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:09,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3153 transitions. [2020-02-10 20:12:09,640 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3153 transitions. Word has length 25 [2020-02-10 20:12:09,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:09,641 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3153 transitions. [2020-02-10 20:12:09,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:09,641 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3153 transitions. [2020-02-10 20:12:09,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:09,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:09,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, 1, 1, 1] [2020-02-10 20:12:09,646 INFO L427 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:09,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:09,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1548123507, now seen corresponding path program 3 times [2020-02-10 20:12:09,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:09,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191609825] [2020-02-10 20:12:09,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191609825] [2020-02-10 20:12:10,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:10,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125646786] [2020-02-10 20:12:10,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:10,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:10,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:10,194 INFO L87 Difference]: Start difference. First operand 785 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:12:10,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:10,366 INFO L93 Difference]: Finished difference Result 1363 states and 4838 transitions. [2020-02-10 20:12:10,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:10,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:10,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:10,376 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:12:10,376 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:10,377 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:10,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:10,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 20:12:10,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3158 transitions. [2020-02-10 20:12:10,435 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3158 transitions. Word has length 25 [2020-02-10 20:12:10,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:10,437 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3158 transitions. [2020-02-10 20:12:10,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:10,437 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3158 transitions. [2020-02-10 20:12:10,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:10,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:10,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, 1, 1, 1] [2020-02-10 20:12:10,441 INFO L427 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:10,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:10,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1766089071, now seen corresponding path program 4 times [2020-02-10 20:12:10,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:10,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418023794] [2020-02-10 20:12:10,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:10,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:10,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418023794] [2020-02-10 20:12:10,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:10,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:10,933 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272999534] [2020-02-10 20:12:10,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:10,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:10,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:10,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:10,934 INFO L87 Difference]: Start difference. First operand 788 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:12:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,115 INFO L93 Difference]: Finished difference Result 1362 states and 4833 transitions. [2020-02-10 20:12:11,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:11,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,122 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:12:11,123 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:12:11,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:12:11,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 20:12:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 20:12:11,170 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 20:12:11,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,171 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 20:12:11,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:11,171 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 20:12:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:11,173 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:11,174 INFO L427 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 930966229, now seen corresponding path program 5 times [2020-02-10 20:12:11,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078961461] [2020-02-10 20:12:11,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:11,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:11,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078961461] [2020-02-10 20:12:11,620 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:11,620 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:11,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868447414] [2020-02-10 20:12:11,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:11,621 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:11,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:11,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:11,621 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:12:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:11,775 INFO L93 Difference]: Finished difference Result 1367 states and 4843 transitions. [2020-02-10 20:12:11,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:11,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:11,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:11,780 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:12:11,780 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:12:11,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:11,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:12:11,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:12:11,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:11,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:12:11,828 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:11,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:11,828 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:12:11,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:11,829 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:12:11,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:11,831 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:11,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, 1, 1, 1] [2020-02-10 20:12:11,831 INFO L427 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:11,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:11,832 INFO L82 PathProgramCache]: Analyzing trace with hash -1753060109, now seen corresponding path program 6 times [2020-02-10 20:12:11,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:11,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919626605] [2020-02-10 20:12:11,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:11,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919626605] [2020-02-10 20:12:12,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:12,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790107019] [2020-02-10 20:12:12,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:12,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:12,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:12,263 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:12,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:12,443 INFO L93 Difference]: Finished difference Result 1364 states and 4834 transitions. [2020-02-10 20:12:12,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:12,444 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:12,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:12,447 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:12,447 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:12:12,448 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:12,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:12:12,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 20:12:12,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:12,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3142 transitions. [2020-02-10 20:12:12,490 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3142 transitions. Word has length 25 [2020-02-10 20:12:12,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:12,490 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3142 transitions. [2020-02-10 20:12:12,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:12,490 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3142 transitions. [2020-02-10 20:12:12,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:12,493 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:12,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, 1, 1, 1] [2020-02-10 20:12:12,493 INFO L427 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:12,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:12,493 INFO L82 PathProgramCache]: Analyzing trace with hash -800396297, now seen corresponding path program 7 times [2020-02-10 20:12:12,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:12,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807242399] [2020-02-10 20:12:12,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:12,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:12,901 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807242399] [2020-02-10 20:12:12,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:12,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:12,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907858658] [2020-02-10 20:12:12,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:12,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:12,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:12,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:12,903 INFO L87 Difference]: Start difference. First operand 782 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:12:13,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,079 INFO L93 Difference]: Finished difference Result 1376 states and 4871 transitions. [2020-02-10 20:12:13,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:13,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:13,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,085 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:12:13,085 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 20:12:13,086 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:13,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 20:12:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 790. [2020-02-10 20:12:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:12:13,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3164 transitions. [2020-02-10 20:12:13,128 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3164 transitions. Word has length 25 [2020-02-10 20:12:13,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,129 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3164 transitions. [2020-02-10 20:12:13,129 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:13,129 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3164 transitions. [2020-02-10 20:12:13,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:13,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,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, 1, 1, 1] [2020-02-10 20:12:13,132 INFO L427 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,132 INFO L82 PathProgramCache]: Analyzing trace with hash 169855317, now seen corresponding path program 8 times [2020-02-10 20:12:13,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367050937] [2020-02-10 20:12:13,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:13,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:13,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367050937] [2020-02-10 20:12:13,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:13,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:13,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865365257] [2020-02-10 20:12:13,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:13,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:13,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:13,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:13,588 INFO L87 Difference]: Start difference. First operand 790 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:12:13,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:13,731 INFO L93 Difference]: Finished difference Result 1378 states and 4871 transitions. [2020-02-10 20:12:13,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:13,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:13,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:13,735 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:12:13,736 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 20:12:13,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:13,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 20:12:13,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 786. [2020-02-10 20:12:13,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:12:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3153 transitions. [2020-02-10 20:12:13,773 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3153 transitions. Word has length 25 [2020-02-10 20:12:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:13,774 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3153 transitions. [2020-02-10 20:12:13,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3153 transitions. [2020-02-10 20:12:13,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:13,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:13,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, 1, 1, 1] [2020-02-10 20:12:13,777 INFO L427 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:13,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:13,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1243295437, now seen corresponding path program 9 times [2020-02-10 20:12:13,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:13,778 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188034940] [2020-02-10 20:12:13,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:13,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:14,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188034940] [2020-02-10 20:12:14,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:14,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786071471] [2020-02-10 20:12:14,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:14,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:14,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:14,204 INFO L87 Difference]: Start difference. First operand 786 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:12:14,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:14,362 INFO L93 Difference]: Finished difference Result 1377 states and 4869 transitions. [2020-02-10 20:12:14,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:14,362 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:14,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:14,366 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:12:14,366 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:12:14,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:14,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:12:14,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 20:12:14,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:12:14,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3160 transitions. [2020-02-10 20:12:14,408 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3160 transitions. Word has length 25 [2020-02-10 20:12:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:14,409 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3160 transitions. [2020-02-10 20:12:14,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3160 transitions. [2020-02-10 20:12:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:14,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:14,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, 1, 1, 1] [2020-02-10 20:12:14,412 INFO L427 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:14,412 INFO L82 PathProgramCache]: Analyzing trace with hash -252037615, now seen corresponding path program 10 times [2020-02-10 20:12:14,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:14,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341472998] [2020-02-10 20:12:14,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:14,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:14,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:14,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341472998] [2020-02-10 20:12:14,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:14,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:14,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365881827] [2020-02-10 20:12:14,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:14,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:14,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:14,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:14,825 INFO L87 Difference]: Start difference. First operand 790 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:12:15,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,020 INFO L93 Difference]: Finished difference Result 1380 states and 4871 transitions. [2020-02-10 20:12:15,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:15,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:15,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,025 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:12:15,025 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:12:15,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:15,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:12:15,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 20:12:15,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:12:15,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 20:12:15,074 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 20:12:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,074 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 20:12:15,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 20:12:15,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:15,076 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,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, 1, 1, 1] [2020-02-10 20:12:15,077 INFO L427 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,077 INFO L82 PathProgramCache]: Analyzing trace with hash 834076727, now seen corresponding path program 11 times [2020-02-10 20:12:15,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552836202] [2020-02-10 20:12:15,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:15,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 20:12:15,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552836202] [2020-02-10 20:12:15,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:15,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:15,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324612841] [2020-02-10 20:12:15,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:15,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:15,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:15,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:15,565 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:12:15,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:15,727 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 20:12:15,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:15,728 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:15,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:15,731 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:12:15,731 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:12:15,732 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:15,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:12:15,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 792. [2020-02-10 20:12:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:12:15,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3160 transitions. [2020-02-10 20:12:15,766 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3160 transitions. Word has length 25 [2020-02-10 20:12:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:15,766 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3160 transitions. [2020-02-10 20:12:15,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3160 transitions. [2020-02-10 20:12:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:15,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:15,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, 1, 1, 1] [2020-02-10 20:12:15,769 INFO L427 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:15,769 INFO L82 PathProgramCache]: Analyzing trace with hash -239008653, now seen corresponding path program 12 times [2020-02-10 20:12:15,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:15,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867116067] [2020-02-10 20:12:15,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:15,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867116067] [2020-02-10 20:12:16,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:16,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121598509] [2020-02-10 20:12:16,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:16,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:16,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:16,183 INFO L87 Difference]: Start difference. First operand 792 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:12:16,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,343 INFO L93 Difference]: Finished difference Result 1384 states and 4875 transitions. [2020-02-10 20:12:16,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:16,343 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:16,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,346 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:12:16,347 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:12:16,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:12:16,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 782. [2020-02-10 20:12:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 20:12:16,372 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 20:12:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:16,372 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 20:12:16,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 20:12:16,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:16,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:16,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, 1, 1, 1] [2020-02-10 20:12:16,375 INFO L427 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:16,375 INFO L82 PathProgramCache]: Analyzing trace with hash 703152055, now seen corresponding path program 13 times [2020-02-10 20:12:16,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:16,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673236058] [2020-02-10 20:12:16,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:16,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:16,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:16,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673236058] [2020-02-10 20:12:16,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:16,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:16,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9877582] [2020-02-10 20:12:16,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:16,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:16,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:16,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:16,815 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:12:16,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:16,979 INFO L93 Difference]: Finished difference Result 1364 states and 4837 transitions. [2020-02-10 20:12:16,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:16,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:16,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:16,983 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:16,983 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:12:16,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:16,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:12:17,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 20:12:17,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:17,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:12:17,016 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:17,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,016 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:12:17,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:17,016 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:12:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:17,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,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, 1, 1, 1] [2020-02-10 20:12:17,018 INFO L427 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1683906773, now seen corresponding path program 14 times [2020-02-10 20:12:17,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068309640] [2020-02-10 20:12:17,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:17,504 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:12:17,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:17,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068309640] [2020-02-10 20:12:17,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:17,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:17,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384239120] [2020-02-10 20:12:17,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:17,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:17,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:17,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:17,512 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:17,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:17,738 INFO L93 Difference]: Finished difference Result 1363 states and 4832 transitions. [2020-02-10 20:12:17,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:17,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:17,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:17,742 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:12:17,742 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:12:17,743 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:17,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:12:17,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 20:12:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:17,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 20:12:17,773 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 20:12:17,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:17,773 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 20:12:17,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:17,773 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 20:12:17,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:17,776 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:17,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, 1, 1, 1] [2020-02-10 20:12:17,776 INFO L427 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:17,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:17,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1665781163, now seen corresponding path program 15 times [2020-02-10 20:12:17,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:17,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31130685] [2020-02-10 20:12:17,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:17,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31130685] [2020-02-10 20:12:18,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:18,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118301185] [2020-02-10 20:12:18,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:18,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:18,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:18,280 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:12:18,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:18,450 INFO L93 Difference]: Finished difference Result 1369 states and 4845 transitions. [2020-02-10 20:12:18,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:18,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:18,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:18,453 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:12:18,453 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:12:18,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:18,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:12:18,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 789. [2020-02-10 20:12:18,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:18,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:12:18,480 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:12:18,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:18,480 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:12:18,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:18,480 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:12:18,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:18,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:18,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, 1, 1, 1] [2020-02-10 20:12:18,482 INFO L427 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:18,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:18,482 INFO L82 PathProgramCache]: Analyzing trace with hash -674523341, now seen corresponding path program 16 times [2020-02-10 20:12:18,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:18,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810962589] [2020-02-10 20:12:18,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:18,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:18,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810962589] [2020-02-10 20:12:18,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:18,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:18,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635537128] [2020-02-10 20:12:18,904 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:18,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:18,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:18,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:18,905 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:12:19,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,083 INFO L93 Difference]: Finished difference Result 1372 states and 4847 transitions. [2020-02-10 20:12:19,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:19,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,087 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:12:19,087 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:12:19,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:19,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:12:19,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 785. [2020-02-10 20:12:19,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:19,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:12:19,116 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:12:19,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,116 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:12:19,117 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:19,117 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:12:19,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:19,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,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, 1, 1, 1] [2020-02-10 20:12:19,119 INFO L427 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1946839113, now seen corresponding path program 17 times [2020-02-10 20:12:19,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108179873] [2020-02-10 20:12:19,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:19,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:19,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108179873] [2020-02-10 20:12:19,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:19,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:19,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764337221] [2020-02-10 20:12:19,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:19,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:19,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:19,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:19,546 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:12:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:19,727 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 20:12:19,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:19,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:19,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:19,732 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:12:19,732 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:12:19,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:19,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:12:19,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 20:12:19,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:19,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:12:19,782 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:12:19,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:19,782 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:12:19,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:19,782 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:12:19,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:19,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:19,784 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:19,784 INFO L427 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:19,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:19,785 INFO L82 PathProgramCache]: Analyzing trace with hash -335898155, now seen corresponding path program 18 times [2020-02-10 20:12:19,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:19,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276724631] [2020-02-10 20:12:19,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:19,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276724631] [2020-02-10 20:12:20,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:20,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670570981] [2020-02-10 20:12:20,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:20,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:20,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:20,204 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:12:20,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:20,359 INFO L93 Difference]: Finished difference Result 1370 states and 4840 transitions. [2020-02-10 20:12:20,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:20,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:20,364 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:20,364 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:12:20,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:12:20,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 782. [2020-02-10 20:12:20,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:20,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 20:12:20,393 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 20:12:20,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:20,393 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 20:12:20,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:20,394 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 20:12:20,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:20,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:20,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, 1, 1, 1] [2020-02-10 20:12:20,396 INFO L427 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:20,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:20,396 INFO L82 PathProgramCache]: Analyzing trace with hash 46993459, now seen corresponding path program 19 times [2020-02-10 20:12:20,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:20,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461879231] [2020-02-10 20:12:20,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:20,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:20,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461879231] [2020-02-10 20:12:20,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:20,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:20,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154668924] [2020-02-10 20:12:20,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:20,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:20,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:20,842 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:12:21,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,022 INFO L93 Difference]: Finished difference Result 1372 states and 4852 transitions. [2020-02-10 20:12:21,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:21,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:21,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,025 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:12:21,025 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:12:21,026 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:21,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:12:21,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 20:12:21,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:21,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:12:21,060 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:12:21,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,061 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:12:21,061 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:21,061 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:12:21,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:21,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,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, 1, 1, 1] [2020-02-10 20:12:21,064 INFO L427 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1657934417, now seen corresponding path program 20 times [2020-02-10 20:12:21,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651600843] [2020-02-10 20:12:21,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:21,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:21,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651600843] [2020-02-10 20:12:21,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:21,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:21,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515562305] [2020-02-10 20:12:21,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:21,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:21,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:21,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:21,483 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:12:21,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:21,633 INFO L93 Difference]: Finished difference Result 1369 states and 4843 transitions. [2020-02-10 20:12:21,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:21,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:21,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:21,638 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:12:21,638 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:12:21,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:12:21,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 785. [2020-02-10 20:12:21,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:21,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:12:21,677 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:12:21,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:21,677 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:12:21,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:21,678 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:12:21,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:21,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:21,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, 1, 1, 1] [2020-02-10 20:12:21,681 INFO L427 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:21,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:21,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1553444395, now seen corresponding path program 21 times [2020-02-10 20:12:21,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:21,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066984183] [2020-02-10 20:12:21,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066984183] [2020-02-10 20:12:22,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:22,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325513714] [2020-02-10 20:12:22,116 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:22,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:22,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:22,117 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:12:22,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,278 INFO L93 Difference]: Finished difference Result 1379 states and 4866 transitions. [2020-02-10 20:12:22,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:22,279 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:22,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,284 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:12:22,284 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:12:22,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:22,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:12:22,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 791. [2020-02-10 20:12:22,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:22,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:12:22,330 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:22,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,330 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:12:22,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:12:22,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:22,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,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, 1, 1, 1] [2020-02-10 20:12:22,333 INFO L427 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1668437521, now seen corresponding path program 22 times [2020-02-10 20:12:22,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438568008] [2020-02-10 20:12:22,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:22,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:22,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438568008] [2020-02-10 20:12:22,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:22,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:22,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465515569] [2020-02-10 20:12:22,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:22,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:22,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:22,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:22,761 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:22,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:22,891 INFO L93 Difference]: Finished difference Result 1380 states and 4862 transitions. [2020-02-10 20:12:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:22,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:22,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:22,895 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:12:22,896 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:12:22,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:22,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:12:22,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 20:12:22,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:22,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:12:22,933 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:22,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:22,933 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:12:22,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:22,934 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:12:22,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:22,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:22,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, 1, 1, 1] [2020-02-10 20:12:22,936 INFO L427 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:22,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:22,936 INFO L82 PathProgramCache]: Analyzing trace with hash -1542941291, now seen corresponding path program 23 times [2020-02-10 20:12:22,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:22,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598231539] [2020-02-10 20:12:22,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:22,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:23,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598231539] [2020-02-10 20:12:23,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:23,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:23,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816627107] [2020-02-10 20:12:23,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:23,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:23,380 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:23,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:23,527 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:12:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:23,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:23,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:23,531 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:23,532 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:12:23,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:23,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:12:23,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:12:23,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:23,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:12:23,561 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:12:23,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:23,562 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:12:23,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:23,562 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:12:23,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:23,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:23,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, 1, 1, 1] [2020-02-10 20:12:23,564 INFO L427 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:23,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:23,565 INFO L82 PathProgramCache]: Analyzing trace with hash 67999667, now seen corresponding path program 24 times [2020-02-10 20:12:23,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:23,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729162847] [2020-02-10 20:12:23,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729162847] [2020-02-10 20:12:24,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:24,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914336069] [2020-02-10 20:12:24,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:24,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:24,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:24,061 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:12:24,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,211 INFO L93 Difference]: Finished difference Result 1374 states and 4847 transitions. [2020-02-10 20:12:24,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:24,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:24,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,215 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:12:24,215 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:12:24,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:24,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:12:24,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 779. [2020-02-10 20:12:24,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:12:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3128 transitions. [2020-02-10 20:12:24,241 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3128 transitions. Word has length 25 [2020-02-10 20:12:24,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,241 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3128 transitions. [2020-02-10 20:12:24,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:24,241 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3128 transitions. [2020-02-10 20:12:24,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:24,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:24,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, 1, 1, 1] [2020-02-10 20:12:24,243 INFO L427 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,243 INFO L82 PathProgramCache]: Analyzing trace with hash -590066189, now seen corresponding path program 25 times [2020-02-10 20:12:24,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692351528] [2020-02-10 20:12:24,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:24,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:24,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692351528] [2020-02-10 20:12:24,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:24,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:24,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147148827] [2020-02-10 20:12:24,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:24,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:24,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:24,674 INFO L87 Difference]: Start difference. First operand 779 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:12:24,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:24,828 INFO L93 Difference]: Finished difference Result 1364 states and 4840 transitions. [2020-02-10 20:12:24,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:24,828 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:24,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:24,832 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:24,832 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:12:24,833 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:12:24,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 789. [2020-02-10 20:12:24,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:24,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 20:12:24,856 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 20:12:24,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:24,857 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 20:12:24,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:24,857 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 20:12:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:24,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:24,859 INFO L427 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 380185425, now seen corresponding path program 26 times [2020-02-10 20:12:24,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:24,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063990501] [2020-02-10 20:12:24,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063990501] [2020-02-10 20:12:25,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:25,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123788348] [2020-02-10 20:12:25,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:25,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:25,304 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:12:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:25,452 INFO L93 Difference]: Finished difference Result 1366 states and 4840 transitions. [2020-02-10 20:12:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:25,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:25,457 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:12:25,457 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:12:25,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:25,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:12:25,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 785. [2020-02-10 20:12:25,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:25,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3150 transitions. [2020-02-10 20:12:25,489 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3150 transitions. Word has length 25 [2020-02-10 20:12:25,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:25,490 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3150 transitions. [2020-02-10 20:12:25,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:25,490 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3150 transitions. [2020-02-10 20:12:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:25,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:25,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, 1, 1, 1] [2020-02-10 20:12:25,492 INFO L427 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:25,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1335967889, now seen corresponding path program 27 times [2020-02-10 20:12:25,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:25,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957305963] [2020-02-10 20:12:25,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:25,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:25,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:25,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957305963] [2020-02-10 20:12:25,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:25,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:25,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175609331] [2020-02-10 20:12:25,938 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:25,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:25,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:25,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:25,939 INFO L87 Difference]: Start difference. First operand 785 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:12:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,100 INFO L93 Difference]: Finished difference Result 1360 states and 4828 transitions. [2020-02-10 20:12:26,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:26,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,104 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:12:26,104 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:12:26,105 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:26,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:12:26,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:12:26,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:26,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3155 transitions. [2020-02-10 20:12:26,138 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,139 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3155 transitions. [2020-02-10 20:12:26,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3155 transitions. [2020-02-10 20:12:26,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:26,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:26,141 INFO L427 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1978244689, now seen corresponding path program 28 times [2020-02-10 20:12:26,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523656036] [2020-02-10 20:12:26,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:26,553 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523656036] [2020-02-10 20:12:26,553 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:26,554 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:26,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293474149] [2020-02-10 20:12:26,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:26,554 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:26,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:26,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:26,554 INFO L87 Difference]: Start difference. First operand 788 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:26,711 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 20:12:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:26,712 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:26,715 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:12:26,715 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 20:12:26,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 20:12:26,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 20:12:26,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3147 transitions. [2020-02-10 20:12:26,746 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3147 transitions. Word has length 25 [2020-02-10 20:12:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:26,746 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3147 transitions. [2020-02-10 20:12:26,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3147 transitions. [2020-02-10 20:12:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:26,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:26,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, 1, 1, 1] [2020-02-10 20:12:26,749 INFO L427 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 718810611, now seen corresponding path program 29 times [2020-02-10 20:12:26,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:26,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512296912] [2020-02-10 20:12:26,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:27,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512296912] [2020-02-10 20:12:27,182 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,182 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:27,182 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503288297] [2020-02-10 20:12:27,182 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:27,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:27,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:27,183 INFO L87 Difference]: Start difference. First operand 785 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:12:27,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:27,326 INFO L93 Difference]: Finished difference Result 1364 states and 4833 transitions. [2020-02-10 20:12:27,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:27,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:27,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:27,329 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:27,330 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:12:27,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:27,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:12:27,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 20:12:27,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:12:27,358 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:12:27,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:27,359 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:12:27,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:12:27,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:27,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:27,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, 1, 1, 1] [2020-02-10 20:12:27,361 INFO L427 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:27,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1965215727, now seen corresponding path program 30 times [2020-02-10 20:12:27,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:27,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448176477] [2020-02-10 20:12:27,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:27,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:27,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448176477] [2020-02-10 20:12:27,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:27,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:27,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172028620] [2020-02-10 20:12:27,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:27,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:27,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:27,842 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:12:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,003 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 20:12:28,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:28,003 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:28,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,007 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:12:28,007 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 20:12:28,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 20:12:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 782. [2020-02-10 20:12:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:28,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3139 transitions. [2020-02-10 20:12:28,032 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3139 transitions. Word has length 25 [2020-02-10 20:12:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,033 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3139 transitions. [2020-02-10 20:12:28,033 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:28,033 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3139 transitions. [2020-02-10 20:12:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:28,034 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:28,034 INFO L427 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1435037641, now seen corresponding path program 31 times [2020-02-10 20:12:28,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483048973] [2020-02-10 20:12:28,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:28,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:28,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483048973] [2020-02-10 20:12:28,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:28,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:28,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600252004] [2020-02-10 20:12:28,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:28,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:28,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:28,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:28,576 INFO L87 Difference]: Start difference. First operand 782 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:12:28,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:28,719 INFO L93 Difference]: Finished difference Result 1370 states and 4854 transitions. [2020-02-10 20:12:28,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:28,719 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:28,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:28,723 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:28,723 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:12:28,723 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:28,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:12:28,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 790. [2020-02-10 20:12:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:12:28,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3161 transitions. [2020-02-10 20:12:28,746 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3161 transitions. Word has length 25 [2020-02-10 20:12:28,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:28,746 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3161 transitions. [2020-02-10 20:12:28,746 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:28,746 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3161 transitions. [2020-02-10 20:12:28,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:28,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:28,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, 1, 1, 1] [2020-02-10 20:12:28,748 INFO L427 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:28,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:28,748 INFO L82 PathProgramCache]: Analyzing trace with hash -464786027, now seen corresponding path program 32 times [2020-02-10 20:12:28,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:28,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228182667] [2020-02-10 20:12:28,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:29,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:29,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228182667] [2020-02-10 20:12:29,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:29,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503408403] [2020-02-10 20:12:29,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:29,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:29,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:29,254 INFO L87 Difference]: Start difference. First operand 790 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:12:29,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:29,399 INFO L93 Difference]: Finished difference Result 1372 states and 4854 transitions. [2020-02-10 20:12:29,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:29,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:29,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:29,402 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:12:29,402 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 20:12:29,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:29,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 20:12:29,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 786. [2020-02-10 20:12:29,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:12:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3150 transitions. [2020-02-10 20:12:29,434 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3150 transitions. Word has length 25 [2020-02-10 20:12:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:29,434 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3150 transitions. [2020-02-10 20:12:29,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:29,434 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3150 transitions. [2020-02-10 20:12:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:29,436 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:29,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, 1, 1, 1] [2020-02-10 20:12:29,437 INFO L427 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:29,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 48097297, now seen corresponding path program 33 times [2020-02-10 20:12:29,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:29,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925832001] [2020-02-10 20:12:29,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:29,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12: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 20:12:29,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925832001] [2020-02-10 20:12:29,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:29,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:29,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229102337] [2020-02-10 20:12:29,843 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:29,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:29,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:29,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:29,844 INFO L87 Difference]: Start difference. First operand 786 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:12:30,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,011 INFO L93 Difference]: Finished difference Result 1369 states and 4848 transitions. [2020-02-10 20:12:30,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:30,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:30,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,015 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:12:30,015 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:12:30,015 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:30,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:12:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 790. [2020-02-10 20:12:30,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:12:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3157 transitions. [2020-02-10 20:12:30,052 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3157 transitions. Word has length 25 [2020-02-10 20:12:30,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,052 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3157 transitions. [2020-02-10 20:12:30,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:30,052 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3157 transitions. [2020-02-10 20:12:30,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:30,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,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, 1, 1, 1] [2020-02-10 20:12:30,055 INFO L427 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1049858223, now seen corresponding path program 34 times [2020-02-10 20:12:30,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358185685] [2020-02-10 20:12:30,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:30,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358185685] [2020-02-10 20:12:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886719367] [2020-02-10 20:12:30,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:30,490 INFO L87 Difference]: Start difference. First operand 790 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:12:30,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:30,651 INFO L93 Difference]: Finished difference Result 1370 states and 4846 transitions. [2020-02-10 20:12:30,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:30,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:30,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:30,655 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:30,655 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:12:30,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:30,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:12:30,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 786. [2020-02-10 20:12:30,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:12:30,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 20:12:30,681 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 20:12:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:30,681 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 20:12:30,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 20:12:30,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:30,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:30,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, 1, 1, 1] [2020-02-10 20:12:30,683 INFO L427 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:30,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash 525031607, now seen corresponding path program 35 times [2020-02-10 20:12:30,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:30,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260327581] [2020-02-10 20:12:30,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260327581] [2020-02-10 20:12:31,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:31,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045094703] [2020-02-10 20:12:31,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:31,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:31,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:31,099 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:12:31,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,242 INFO L93 Difference]: Finished difference Result 1374 states and 4855 transitions. [2020-02-10 20:12:31,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:31,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,245 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:12:31,245 INFO L226 Difference]: Without dead ends: 1359 [2020-02-10 20:12:31,246 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:31,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2020-02-10 20:12:31,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 791. [2020-02-10 20:12:31,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:31,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:12:31,269 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:31,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,269 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:12:31,269 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:31,269 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:12:31,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:31,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,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, 1, 1, 1] [2020-02-10 20:12:31,271 INFO L427 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1062887185, now seen corresponding path program 36 times [2020-02-10 20:12:31,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88037026] [2020-02-10 20:12:31,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:31,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:31,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88037026] [2020-02-10 20:12:31,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:31,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:31,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184127668] [2020-02-10 20:12:31,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:31,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:31,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:31,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:31,718 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:31,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:31,862 INFO L93 Difference]: Finished difference Result 1373 states and 4848 transitions. [2020-02-10 20:12:31,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:31,863 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:31,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:31,866 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:12:31,866 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:31,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:31,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:31,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 782. [2020-02-10 20:12:31,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:31,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3136 transitions. [2020-02-10 20:12:31,889 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3136 transitions. Word has length 25 [2020-02-10 20:12:31,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:31,890 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3136 transitions. [2020-02-10 20:12:31,890 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:31,890 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3136 transitions. [2020-02-10 20:12:31,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:31,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:31,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:31,892 INFO L427 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:31,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:31,892 INFO L82 PathProgramCache]: Analyzing trace with hash 68510711, now seen corresponding path program 37 times [2020-02-10 20:12:31,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:31,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904850254] [2020-02-10 20:12:31,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:32,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 20:12:32,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904850254] [2020-02-10 20:12:32,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:32,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:32,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576172012] [2020-02-10 20:12:32,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:32,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:32,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:32,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:32,339 INFO L87 Difference]: Start difference. First operand 782 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:12:32,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:32,517 INFO L93 Difference]: Finished difference Result 1359 states and 4823 transitions. [2020-02-10 20:12:32,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:32,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:32,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:32,521 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:12:32,521 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:12:32,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:32,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:12:32,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 788. [2020-02-10 20:12:32,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:32,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:12:32,545 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:12:32,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:32,545 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:12:32,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:32,545 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:12:32,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:32,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:32,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, 1, 1, 1] [2020-02-10 20:12:32,547 INFO L427 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:32,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:32,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1049265429, now seen corresponding path program 38 times [2020-02-10 20:12:32,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:32,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601833220] [2020-02-10 20:12:32,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,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 20:12:33,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601833220] [2020-02-10 20:12:33,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:33,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19876912] [2020-02-10 20:12:33,004 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:33,004 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:33,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:33,005 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:12:33,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,147 INFO L93 Difference]: Finished difference Result 1358 states and 4818 transitions. [2020-02-10 20:12:33,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:33,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:33,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,150 INFO L225 Difference]: With dead ends: 1358 [2020-02-10 20:12:33,150 INFO L226 Difference]: Without dead ends: 1343 [2020-02-10 20:12:33,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:33,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2020-02-10 20:12:33,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 785. [2020-02-10 20:12:33,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:33,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:12:33,173 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:12:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,173 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:12:33,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:12:33,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:33,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,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, 1, 1, 1] [2020-02-10 20:12:33,175 INFO L427 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,175 INFO L82 PathProgramCache]: Analyzing trace with hash -374388429, now seen corresponding path program 39 times [2020-02-10 20:12:33,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213775177] [2020-02-10 20:12:33,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:33,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:33,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213775177] [2020-02-10 20:12:33,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:33,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:33,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821686005] [2020-02-10 20:12:33,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:33,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:33,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:33,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:33,613 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:12:33,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:33,769 INFO L93 Difference]: Finished difference Result 1362 states and 4827 transitions. [2020-02-10 20:12:33,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:33,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:33,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:33,773 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:12:33,773 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:12:33,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:33,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:12:33,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 789. [2020-02-10 20:12:33,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:33,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:12:33,797 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:12:33,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:33,797 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:12:33,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:33,797 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:12:33,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:33,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:33,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, 1, 1, 1] [2020-02-10 20:12:33,799 INFO L427 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 627372497, now seen corresponding path program 40 times [2020-02-10 20:12:33,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:33,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129660233] [2020-02-10 20:12:33,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129660233] [2020-02-10 20:12:34,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:34,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651719352] [2020-02-10 20:12:34,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:34,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:34,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:34,232 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:12:34,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,377 INFO L93 Difference]: Finished difference Result 1363 states and 4825 transitions. [2020-02-10 20:12:34,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:34,377 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:34,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,381 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:12:34,381 INFO L226 Difference]: Without dead ends: 1345 [2020-02-10 20:12:34,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:34,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1345 states. [2020-02-10 20:12:34,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1345 to 785. [2020-02-10 20:12:34,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:34,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:12:34,406 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:34,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:34,406 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:12:34,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:34,406 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:12:34,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:34,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:34,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, 1, 1, 1] [2020-02-10 20:12:34,408 INFO L427 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:34,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2039083063, now seen corresponding path program 41 times [2020-02-10 20:12:34,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:34,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068446553] [2020-02-10 20:12:34,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:34,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:34,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068446553] [2020-02-10 20:12:34,825 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:34,825 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:34,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540331473] [2020-02-10 20:12:34,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:34,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:34,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:34,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:34,826 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:34,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:34,989 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 20:12:34,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:34,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:34,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:34,993 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:12:34,993 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:12:34,994 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:35,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:12:35,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:12:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:35,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:12:35,019 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:12:35,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,019 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:12:35,019 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:35,019 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:12:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:35,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,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, 1, 1, 1] [2020-02-10 20:12:35,021 INFO L427 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,021 INFO L82 PathProgramCache]: Analyzing trace with hash 965997683, now seen corresponding path program 42 times [2020-02-10 20:12:35,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189049981] [2020-02-10 20:12:35,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:35,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189049981] [2020-02-10 20:12:35,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:35,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:35,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74134027] [2020-02-10 20:12:35,460 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:35,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:35,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:35,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:35,461 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:12:35,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:35,617 INFO L93 Difference]: Finished difference Result 1361 states and 4818 transitions. [2020-02-10 20:12:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:35,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:35,620 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:12:35,620 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 20:12:35,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 20:12:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 782. [2020-02-10 20:12:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:12:35,658 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:12:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:35,658 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:12:35,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:12:35,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:35,660 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:35,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, 1, 1, 1] [2020-02-10 20:12:35,661 INFO L427 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:35,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:35,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1338386193, now seen corresponding path program 43 times [2020-02-10 20:12:35,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:35,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109974714] [2020-02-10 20:12:35,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:35,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109974714] [2020-02-10 20:12:36,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:36,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934720546] [2020-02-10 20:12:36,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:36,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:36,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:36,068 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:12:36,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,224 INFO L93 Difference]: Finished difference Result 1366 states and 4835 transitions. [2020-02-10 20:12:36,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:36,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:36,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,228 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:12:36,228 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:12:36,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:36,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:12:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 788. [2020-02-10 20:12:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:36,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:12:36,263 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:12:36,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,263 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:12:36,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:36,263 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:12:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:36,270 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,270 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:36,270 INFO L427 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,271 INFO L82 PathProgramCache]: Analyzing trace with hash -1345640145, now seen corresponding path program 44 times [2020-02-10 20:12:36,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107841189] [2020-02-10 20:12:36,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:36,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:36,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107841189] [2020-02-10 20:12:36,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:36,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:36,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793428940] [2020-02-10 20:12:36,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:36,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:36,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:36,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:36,679 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:12:36,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:36,855 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 20:12:36,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:36,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:36,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:36,860 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:12:36,860 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:12:36,861 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:36,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:12:36,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 785. [2020-02-10 20:12:36,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:12:36,889 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:36,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:36,889 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:12:36,889 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:36,889 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:12:36,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:36,891 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:36,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, 1, 1, 1] [2020-02-10 20:12:36,891 INFO L427 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:36,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:36,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1862489515, now seen corresponding path program 45 times [2020-02-10 20:12:36,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:36,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418848895] [2020-02-10 20:12:36,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:36,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,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 20:12:37,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418848895] [2020-02-10 20:12:37,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:37,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363966057] [2020-02-10 20:12:37,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:37,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:37,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:37,316 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:37,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:37,506 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:12:37,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:37,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:37,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:37,510 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:37,511 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:12:37,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:37,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:12:37,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 790. [2020-02-10 20:12:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:12:37,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:12:37,535 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:12:37,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:37,535 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:12:37,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:37,535 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:12:37,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:37,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:37,536 INFO L427 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:37,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:37,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1324633937, now seen corresponding path program 46 times [2020-02-10 20:12:37,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:37,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246105244] [2020-02-10 20:12:37,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:37,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:37,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:37,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246105244] [2020-02-10 20:12:37,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:37,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:37,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198390649] [2020-02-10 20:12:37,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:37,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:37,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:37,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:37,992 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:12:38,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,191 INFO L93 Difference]: Finished difference Result 1369 states and 4835 transitions. [2020-02-10 20:12:38,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:38,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:38,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,194 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:12:38,195 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:38,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:12:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:38,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:12:38,218 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:12:38,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,218 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:12:38,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:12:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:38,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,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, 1, 1, 1] [2020-02-10 20:12:38,220 INFO L427 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1851986411, now seen corresponding path program 47 times [2020-02-10 20:12:38,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592198714] [2020-02-10 20:12:38,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:38,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:38,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592198714] [2020-02-10 20:12:38,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:38,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:38,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665478928] [2020-02-10 20:12:38,749 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:38,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:38,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:38,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:38,749 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:12:38,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:38,901 INFO L93 Difference]: Finished difference Result 1362 states and 4821 transitions. [2020-02-10 20:12:38,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:38,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:38,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:38,905 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:12:38,905 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:38,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:38,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:38,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 788. [2020-02-10 20:12:38,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:38,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:12:38,929 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:12:38,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:38,929 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:12:38,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:12:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:38,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:38,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:38,931 INFO L427 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:38,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:38,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1369895505, now seen corresponding path program 48 times [2020-02-10 20:12:38,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:38,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908216711] [2020-02-10 20:12:38,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:38,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908216711] [2020-02-10 20:12:39,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:39,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311415186] [2020-02-10 20:12:39,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:39,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:39,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:39,364 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:12:39,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:39,539 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 20:12:39,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:39,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:39,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:39,542 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:39,543 INFO L226 Difference]: Without dead ends: 1341 [2020-02-10 20:12:39,543 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:39,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1341 states. [2020-02-10 20:12:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1341 to 779. [2020-02-10 20:12:39,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:12:39,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3125 transitions. [2020-02-10 20:12:39,566 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3125 transitions. Word has length 25 [2020-02-10 20:12:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:39,567 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3125 transitions. [2020-02-10 20:12:39,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:39,567 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3125 transitions. [2020-02-10 20:12:39,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:39,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:39,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:39,568 INFO L427 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:39,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:39,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1224707533, now seen corresponding path program 49 times [2020-02-10 20:12:39,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:39,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856787588] [2020-02-10 20:12:39,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:39,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856787588] [2020-02-10 20:12:39,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:39,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:39,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005374820] [2020-02-10 20:12:39,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:39,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:39,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:39,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:39,976 INFO L87 Difference]: Start difference. First operand 779 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:12:40,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,141 INFO L93 Difference]: Finished difference Result 1388 states and 4908 transitions. [2020-02-10 20:12:40,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:40,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:40,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,145 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:12:40,145 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 20:12:40,146 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:40,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 20:12:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 791. [2020-02-10 20:12:40,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 20:12:40,169 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 20:12:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,169 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 20:12:40,169 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:40,169 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 20:12:40,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:40,170 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,170 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:40,171 INFO L427 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,171 INFO L82 PathProgramCache]: Analyzing trace with hash -254455919, now seen corresponding path program 50 times [2020-02-10 20:12:40,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489433326] [2020-02-10 20:12:40,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:40,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:40,622 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489433326] [2020-02-10 20:12:40,622 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:40,622 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:40,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278389998] [2020-02-10 20:12:40,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:40,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:40,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:40,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:40,623 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:12:40,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:40,771 INFO L93 Difference]: Finished difference Result 1390 states and 4908 transitions. [2020-02-10 20:12:40,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:40,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:40,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:40,775 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:12:40,775 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:12:40,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:40,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:12:40,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 20:12:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3155 transitions. [2020-02-10 20:12:40,799 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:40,799 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3155 transitions. [2020-02-10 20:12:40,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3155 transitions. [2020-02-10 20:12:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:40,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:40,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, 1, 1, 1] [2020-02-10 20:12:40,801 INFO L427 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1667606673, now seen corresponding path program 51 times [2020-02-10 20:12:40,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:40,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333337432] [2020-02-10 20:12:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333337432] [2020-02-10 20:12:41,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:41,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060561680] [2020-02-10 20:12:41,202 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:41,203 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:41,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:41,203 INFO L87 Difference]: Start difference. First operand 787 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:41,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:41,349 INFO L93 Difference]: Finished difference Result 1389 states and 4906 transitions. [2020-02-10 20:12:41,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:41,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:41,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:41,353 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:12:41,354 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:12:41,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:41,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:12:41,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 20:12:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:41,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 20:12:41,378 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 20:12:41,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:41,378 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 20:12:41,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:41,378 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 20:12:41,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:41,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:41,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, 1, 1, 1] [2020-02-10 20:12:41,380 INFO L427 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:41,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:41,380 INFO L82 PathProgramCache]: Analyzing trace with hash -676348851, now seen corresponding path program 52 times [2020-02-10 20:12:41,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:41,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414406315] [2020-02-10 20:12:41,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:41,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:41,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414406315] [2020-02-10 20:12:41,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:41,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:41,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554331641] [2020-02-10 20:12:41,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:41,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:41,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:41,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:41,828 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:12:42,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,038 INFO L93 Difference]: Finished difference Result 1392 states and 4908 transitions. [2020-02-10 20:12:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:42,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,042 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:12:42,042 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:12:42,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:12:42,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 20:12:42,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:42,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 20:12:42,084 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 20:12:42,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,084 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 20:12:42,084 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:42,084 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 20:12:42,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:42,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,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, 1, 1, 1] [2020-02-10 20:12:42,086 INFO L427 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,086 INFO L82 PathProgramCache]: Analyzing trace with hash 409765491, now seen corresponding path program 53 times [2020-02-10 20:12:42,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755551379] [2020-02-10 20:12:42,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:42,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:42,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755551379] [2020-02-10 20:12:42,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:42,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:42,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879996981] [2020-02-10 20:12:42,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:42,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:42,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:42,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:42,530 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:12:42,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:42,684 INFO L93 Difference]: Finished difference Result 1395 states and 4916 transitions. [2020-02-10 20:12:42,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:42,685 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:42,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:42,688 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:12:42,689 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:12:42,689 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:42,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:12:42,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 793. [2020-02-10 20:12:42,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:12:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3162 transitions. [2020-02-10 20:12:42,712 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3162 transitions. Word has length 25 [2020-02-10 20:12:42,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:42,712 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3162 transitions. [2020-02-10 20:12:42,712 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:42,712 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3162 transitions. [2020-02-10 20:12:42,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:42,713 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:42,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, 1, 1, 1] [2020-02-10 20:12:42,714 INFO L427 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:42,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:42,714 INFO L82 PathProgramCache]: Analyzing trace with hash -663319889, now seen corresponding path program 54 times [2020-02-10 20:12:42,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:42,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301594215] [2020-02-10 20:12:42,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:43,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301594215] [2020-02-10 20:12:43,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:43,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435377677] [2020-02-10 20:12:43,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:43,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:43,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:43,149 INFO L87 Difference]: Start difference. First operand 793 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:12:43,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,313 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 20:12:43,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:43,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:43,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,317 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:12:43,318 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:12:43,318 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:43,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:12:43,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 783. [2020-02-10 20:12:43,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:12:43,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3140 transitions. [2020-02-10 20:12:43,342 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3140 transitions. Word has length 25 [2020-02-10 20:12:43,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,342 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3140 transitions. [2020-02-10 20:12:43,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:43,342 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3140 transitions. [2020-02-10 20:12:43,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:43,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,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, 1, 1, 1] [2020-02-10 20:12:43,343 INFO L427 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1647193259, now seen corresponding path program 55 times [2020-02-10 20:12:43,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370611544] [2020-02-10 20:12:43,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:43,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 20:12:43,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370611544] [2020-02-10 20:12:43,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:43,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:43,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806301198] [2020-02-10 20:12:43,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:43,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:43,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:43,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:43,740 INFO L87 Difference]: Start difference. First operand 783 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:12:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:43,914 INFO L93 Difference]: Finished difference Result 1385 states and 4897 transitions. [2020-02-10 20:12:43,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:43,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:43,918 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:12:43,918 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:12:43,918 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:43,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:12:43,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:12:43,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:43,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3162 transitions. [2020-02-10 20:12:43,941 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3162 transitions. Word has length 25 [2020-02-10 20:12:43,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:43,942 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3162 transitions. [2020-02-10 20:12:43,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:43,942 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3162 transitions. [2020-02-10 20:12:43,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:43,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:43,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, 1, 1, 1] [2020-02-10 20:12:43,943 INFO L427 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:43,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:43,943 INFO L82 PathProgramCache]: Analyzing trace with hash -676941645, now seen corresponding path program 56 times [2020-02-10 20:12:43,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:43,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478030146] [2020-02-10 20:12:43,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478030146] [2020-02-10 20:12:44,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:44,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550600692] [2020-02-10 20:12:44,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:44,362 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:44,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:44,363 INFO L87 Difference]: Start difference. First operand 791 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:12:44,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:44,527 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 20:12:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:44,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:44,532 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:12:44,532 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:12:44,532 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:44,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:12:44,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:12:44,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:44,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3151 transitions. [2020-02-10 20:12:44,566 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3151 transitions. Word has length 25 [2020-02-10 20:12:44,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:44,566 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3151 transitions. [2020-02-10 20:12:44,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:44,566 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3151 transitions. [2020-02-10 20:12:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:44,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:44,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:44,568 INFO L427 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:44,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:44,568 INFO L82 PathProgramCache]: Analyzing trace with hash -164058321, now seen corresponding path program 57 times [2020-02-10 20:12:44,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:44,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759929240] [2020-02-10 20:12:44,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:44,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:44,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759929240] [2020-02-10 20:12:44,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:44,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:44,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346252050] [2020-02-10 20:12:44,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:44,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:44,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:44,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:44,992 INFO L87 Difference]: Start difference. First operand 787 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:12:45,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,163 INFO L93 Difference]: Finished difference Result 1384 states and 4891 transitions. [2020-02-10 20:12:45,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:45,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:45,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,167 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:12:45,167 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:12:45,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:45,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:12:45,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 791. [2020-02-10 20:12:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:45,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:12:45,190 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:12:45,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,191 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:12:45,191 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:45,191 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:12:45,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:45,192 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,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, 1, 1, 1] [2020-02-10 20:12:45,192 INFO L427 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 837702605, now seen corresponding path program 58 times [2020-02-10 20:12:45,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963176154] [2020-02-10 20:12:45,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:45,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:45,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963176154] [2020-02-10 20:12:45,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:45,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:45,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324822235] [2020-02-10 20:12:45,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:45,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:45,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:45,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:45,655 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:12:45,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:45,819 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 20:12:45,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:45,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:45,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:45,823 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:12:45,823 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:12:45,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:45,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:12:45,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 787. [2020-02-10 20:12:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:12:45,848 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:12:45,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:45,848 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:12:45,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:45,848 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:12:45,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:45,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:45,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, 1, 1, 1] [2020-02-10 20:12:45,849 INFO L427 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:45,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:45,850 INFO L82 PathProgramCache]: Analyzing trace with hash 312875989, now seen corresponding path program 59 times [2020-02-10 20:12:45,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:45,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161359301] [2020-02-10 20:12:45,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:45,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161359301] [2020-02-10 20:12:46,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:46,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021076508] [2020-02-10 20:12:46,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:46,269 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:46,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:46,269 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:12:46,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:46,458 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:12:46,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:46,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:46,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:46,462 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:12:46,462 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:12:46,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:12:46,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 20:12:46,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:12:46,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3156 transitions. [2020-02-10 20:12:46,486 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3156 transitions. Word has length 25 [2020-02-10 20:12:46,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:46,486 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3156 transitions. [2020-02-10 20:12:46,486 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:46,486 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3156 transitions. [2020-02-10 20:12:46,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:46,487 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:46,487 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:46,487 INFO L427 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:46,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:46,487 INFO L82 PathProgramCache]: Analyzing trace with hash 850731567, now seen corresponding path program 60 times [2020-02-10 20:12:46,488 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:46,488 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602572632] [2020-02-10 20:12:46,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:46,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602572632] [2020-02-10 20:12:46,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:46,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:46,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73391794] [2020-02-10 20:12:46,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:46,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:46,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:46,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:46,907 INFO L87 Difference]: Start difference. First operand 792 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:12:47,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,061 INFO L93 Difference]: Finished difference Result 1388 states and 4891 transitions. [2020-02-10 20:12:47,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:47,061 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:47,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,065 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:12:47,065 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 20:12:47,065 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:47,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 20:12:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 783. [2020-02-10 20:12:47,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:12:47,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3136 transitions. [2020-02-10 20:12:47,087 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3136 transitions. Word has length 25 [2020-02-10 20:12:47,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,087 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3136 transitions. [2020-02-10 20:12:47,088 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:47,088 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3136 transitions. [2020-02-10 20:12:47,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:47,089 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,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, 1, 1, 1] [2020-02-10 20:12:47,089 INFO L427 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1359903445, now seen corresponding path program 61 times [2020-02-10 20:12:47,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283363221] [2020-02-10 20:12:47,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:47,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:47,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283363221] [2020-02-10 20:12:47,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:47,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:47,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664203400] [2020-02-10 20:12:47,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:47,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:47,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:47,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:47,513 INFO L87 Difference]: Start difference. First operand 783 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:12:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:47,695 INFO L93 Difference]: Finished difference Result 1387 states and 4897 transitions. [2020-02-10 20:12:47,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:47,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:47,699 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:12:47,699 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:12:47,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:47,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:12:47,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 20:12:47,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:47,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:12:47,725 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:12:47,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:47,725 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:12:47,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:47,725 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:12:47,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:47,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:47,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, 1, 1, 1] [2020-02-10 20:12:47,726 INFO L427 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:47,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:47,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1943806029, now seen corresponding path program 62 times [2020-02-10 20:12:47,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:47,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094796891] [2020-02-10 20:12:47,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094796891] [2020-02-10 20:12:48,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:48,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976578763] [2020-02-10 20:12:48,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:48,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:48,238 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:12:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,389 INFO L93 Difference]: Finished difference Result 1390 states and 4899 transitions. [2020-02-10 20:12:48,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:48,389 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,392 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:12:48,392 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:12:48,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:48,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:12:48,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:12:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:48,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:12:48,414 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:12:48,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:48,415 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:12:48,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:12:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:48,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:48,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, 1, 1, 1] [2020-02-10 20:12:48,416 INFO L427 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:48,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1009029773, now seen corresponding path program 63 times [2020-02-10 20:12:48,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:48,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315796360] [2020-02-10 20:12:48,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:48,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:48,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315796360] [2020-02-10 20:12:48,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:48,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:48,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386192635] [2020-02-10 20:12:48,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:48,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:48,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:48,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:48,834 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:12:48,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:48,993 INFO L93 Difference]: Finished difference Result 1385 states and 4889 transitions. [2020-02-10 20:12:48,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:48,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:48,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:48,997 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:12:48,997 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:12:48,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:49,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:12:49,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:12:49,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:12:49,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 20:12:49,020 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 20:12:49,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,020 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 20:12:49,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 20:12:49,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:49,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,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, 1, 1, 1] [2020-02-10 20:12:49,022 INFO L427 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,022 INFO L82 PathProgramCache]: Analyzing trace with hash -7268847, now seen corresponding path program 64 times [2020-02-10 20:12:49,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621092784] [2020-02-10 20:12:49,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:49,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:49,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621092784] [2020-02-10 20:12:49,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:49,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:49,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697817548] [2020-02-10 20:12:49,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:49,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:49,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:49,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:49,439 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:12:49,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:49,579 INFO L93 Difference]: Finished difference Result 1386 states and 4887 transitions. [2020-02-10 20:12:49,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:49,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:49,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:49,583 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:12:49,583 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:12:49,584 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:49,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:12:49,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:12:49,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:12:49,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3143 transitions. [2020-02-10 20:12:49,606 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3143 transitions. Word has length 25 [2020-02-10 20:12:49,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:49,606 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3143 transitions. [2020-02-10 20:12:49,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:49,606 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3143 transitions. [2020-02-10 20:12:49,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:49,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:49,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, 1, 1, 1] [2020-02-10 20:12:49,608 INFO L427 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:49,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:49,608 INFO L82 PathProgramCache]: Analyzing trace with hash -953988395, now seen corresponding path program 65 times [2020-02-10 20:12:49,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:49,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704253096] [2020-02-10 20:12:49,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:49,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704253096] [2020-02-10 20:12:50,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:50,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167332940] [2020-02-10 20:12:50,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:50,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:50,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:50,017 INFO L87 Difference]: Start difference. First operand 787 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:12:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,180 INFO L93 Difference]: Finished difference Result 1392 states and 4900 transitions. [2020-02-10 20:12:50,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:50,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:50,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,184 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:12:50,184 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:12:50,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:50,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:12:50,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 20:12:50,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:12:50,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3152 transitions. [2020-02-10 20:12:50,206 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3152 transitions. Word has length 25 [2020-02-10 20:12:50,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,206 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3152 transitions. [2020-02-10 20:12:50,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:50,206 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3152 transitions. [2020-02-10 20:12:50,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:50,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:50,208 INFO L427 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,208 INFO L82 PathProgramCache]: Analyzing trace with hash 656952563, now seen corresponding path program 66 times [2020-02-10 20:12:50,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583970143] [2020-02-10 20:12:50,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:50,660 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:12:50,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:50,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583970143] [2020-02-10 20:12:50,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:50,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:50,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793930816] [2020-02-10 20:12:50,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:50,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:50,667 INFO L87 Difference]: Start difference. First operand 792 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:12:50,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:50,837 INFO L93 Difference]: Finished difference Result 1390 states and 4891 transitions. [2020-02-10 20:12:50,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:50,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:50,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:50,841 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:12:50,841 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:12:50,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:50,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:12:50,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 20:12:50,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:12:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 20:12:50,863 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 20:12:50,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:50,863 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 20:12:50,864 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:50,864 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 20:12:50,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:50,865 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:50,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, 1, 1, 1] [2020-02-10 20:12:50,865 INFO L427 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:50,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:50,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1029341073, now seen corresponding path program 67 times [2020-02-10 20:12:50,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:50,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254119600] [2020-02-10 20:12:50,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:50,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254119600] [2020-02-10 20:12:51,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:51,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616298487] [2020-02-10 20:12:51,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:51,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:51,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:51,374 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:12:51,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:51,501 INFO L93 Difference]: Finished difference Result 1399 states and 4924 transitions. [2020-02-10 20:12:51,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:51,502 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:51,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:51,505 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:12:51,505 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:12:51,506 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:51,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:12:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 794. [2020-02-10 20:12:51,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:12:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:12:51,539 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:12:51,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:51,540 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:12:51,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:51,540 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:12:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:51,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:51,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, 1, 1, 1] [2020-02-10 20:12:51,542 INFO L427 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:51,542 INFO L82 PathProgramCache]: Analyzing trace with hash -43744307, now seen corresponding path program 68 times [2020-02-10 20:12:51,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:51,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800136703] [2020-02-10 20:12:51,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:51,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:51,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800136703] [2020-02-10 20:12:51,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:51,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:51,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702280848] [2020-02-10 20:12:51,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:51,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:51,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:51,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:51,952 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:12:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,094 INFO L93 Difference]: Finished difference Result 1400 states and 4920 transitions. [2020-02-10 20:12:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:52,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,099 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:12:52,099 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:12:52,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:52,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:12:52,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 788. [2020-02-10 20:12:52,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:52,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:12:52,122 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:12:52,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,122 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:12:52,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:52,122 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:12:52,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:52,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:52,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, 1, 1, 1] [2020-02-10 20:12:52,124 INFO L427 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,124 INFO L82 PathProgramCache]: Analyzing trace with hash -571096781, now seen corresponding path program 69 times [2020-02-10 20:12:52,124 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497988749] [2020-02-10 20:12:52,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:52,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497988749] [2020-02-10 20:12:52,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:52,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:52,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21005455] [2020-02-10 20:12:52,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:52,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:52,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:52,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:52,543 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:12:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:52,681 INFO L93 Difference]: Finished difference Result 1396 states and 4912 transitions. [2020-02-10 20:12:52,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:52,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:52,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:52,685 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:12:52,686 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:12:52,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:52,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:12:52,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 793. [2020-02-10 20:12:52,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:12:52,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 20:12:52,709 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 20:12:52,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:52,709 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 20:12:52,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:52,709 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 20:12:52,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:52,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12: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, 1, 1, 1] [2020-02-10 20:12:52,710 INFO L427 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:52,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:52,710 INFO L82 PathProgramCache]: Analyzing trace with hash -33241203, now seen corresponding path program 70 times [2020-02-10 20:12:52,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:52,711 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540051281] [2020-02-10 20:12:52,711 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,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 20:12:53,148 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540051281] [2020-02-10 20:12:53,148 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:53,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775338091] [2020-02-10 20:12:53,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:53,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:53,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:53,149 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:12:53,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,303 INFO L93 Difference]: Finished difference Result 1395 states and 4905 transitions. [2020-02-10 20:12:53,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:53,303 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:53,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,307 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:12:53,307 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:12:53,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:53,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:12:53,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 788. [2020-02-10 20:12:53,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:53,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3141 transitions. [2020-02-10 20:12:53,330 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:53,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,330 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3141 transitions. [2020-02-10 20:12:53,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:53,330 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3141 transitions. [2020-02-10 20:12:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:53,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,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, 1, 1, 1] [2020-02-10 20:12:53,331 INFO L427 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,331 INFO L82 PathProgramCache]: Analyzing trace with hash -550090573, now seen corresponding path program 71 times [2020-02-10 20:12:53,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769293387] [2020-02-10 20:12:53,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:53,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 20:12:53,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769293387] [2020-02-10 20:12:53,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:53,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:53,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134661791] [2020-02-10 20:12:53,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:53,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:53,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:53,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:53,756 INFO L87 Difference]: Start difference. First operand 788 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:53,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:53,917 INFO L93 Difference]: Finished difference Result 1398 states and 4911 transitions. [2020-02-10 20:12:53,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:53,917 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:53,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:53,921 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:12:53,921 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:12:53,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:53,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:12:53,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 793. [2020-02-10 20:12:53,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:12:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3150 transitions. [2020-02-10 20:12:53,945 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3150 transitions. Word has length 25 [2020-02-10 20:12:53,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:53,946 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3150 transitions. [2020-02-10 20:12:53,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:53,946 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3150 transitions. [2020-02-10 20:12:53,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:53,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:53,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, 1, 1, 1] [2020-02-10 20:12:53,947 INFO L427 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:53,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:53,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1060850385, now seen corresponding path program 72 times [2020-02-10 20:12:53,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:53,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341952581] [2020-02-10 20:12:53,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:53,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341952581] [2020-02-10 20:12:54,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:54,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904355037] [2020-02-10 20:12:54,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:54,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:54,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:54,343 INFO L87 Difference]: Start difference. First operand 793 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:12:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:54,486 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 20:12:54,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:54,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:54,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:54,490 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:12:54,490 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:12:54,491 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:54,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:12:54,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 779. [2020-02-10 20:12:54,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:12:54,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3122 transitions. [2020-02-10 20:12:54,513 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3122 transitions. Word has length 25 [2020-02-10 20:12:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:54,513 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3122 transitions. [2020-02-10 20:12:54,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3122 transitions. [2020-02-10 20:12:54,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:54,514 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:54,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:54,515 INFO L427 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:54,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:54,515 INFO L82 PathProgramCache]: Analyzing trace with hash 66685201, now seen corresponding path program 73 times [2020-02-10 20:12:54,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:54,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087072779] [2020-02-10 20:12:54,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:54,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:54,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087072779] [2020-02-10 20:12:54,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:54,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:54,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90440653] [2020-02-10 20:12:54,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:54,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:54,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:54,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:54,928 INFO L87 Difference]: Start difference. First operand 779 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:12:55,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,078 INFO L93 Difference]: Finished difference Result 1362 states and 4829 transitions. [2020-02-10 20:12:55,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:55,078 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:55,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,082 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:12:55,082 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:12:55,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:55,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:12:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 788. [2020-02-10 20:12:55,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:55,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3152 transitions. [2020-02-10 20:12:55,105 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3152 transitions. Word has length 25 [2020-02-10 20:12:55,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,105 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3152 transitions. [2020-02-10 20:12:55,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3152 transitions. [2020-02-10 20:12:55,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:55,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,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, 1, 1, 1] [2020-02-10 20:12:55,107 INFO L427 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1047439919, now seen corresponding path program 74 times [2020-02-10 20:12:55,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075842462] [2020-02-10 20:12:55,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:55,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:55,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075842462] [2020-02-10 20:12:55,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:55,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:55,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406135706] [2020-02-10 20:12:55,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:55,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:55,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:55,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:55,538 INFO L87 Difference]: Start difference. First operand 788 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:12:55,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:55,698 INFO L93 Difference]: Finished difference Result 1361 states and 4824 transitions. [2020-02-10 20:12:55,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:55,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:55,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:55,702 INFO L225 Difference]: With dead ends: 1361 [2020-02-10 20:12:55,702 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:12:55,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:55,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:12:55,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 20:12:55,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:55,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3144 transitions. [2020-02-10 20:12:55,725 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3144 transitions. Word has length 25 [2020-02-10 20:12:55,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:55,725 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3144 transitions. [2020-02-10 20:12:55,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:55,725 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3144 transitions. [2020-02-10 20:12:55,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:55,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:55,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, 1, 1, 1] [2020-02-10 20:12:55,726 INFO L427 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:55,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:55,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1992719279, now seen corresponding path program 75 times [2020-02-10 20:12:55,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:55,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267495411] [2020-02-10 20:12:55,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267495411] [2020-02-10 20:12:56,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:56,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895568777] [2020-02-10 20:12:56,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:56,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:56,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:56,131 INFO L87 Difference]: Start difference. First operand 785 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:12:56,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,270 INFO L93 Difference]: Finished difference Result 1367 states and 4837 transitions. [2020-02-10 20:12:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:56,271 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:56,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,275 INFO L225 Difference]: With dead ends: 1367 [2020-02-10 20:12:56,275 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:12:56,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:12:56,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 789. [2020-02-10 20:12:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:12:56,297 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:12:56,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,298 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:12:56,298 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:12:56,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:56,299 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,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, 1, 1, 1] [2020-02-10 20:12:56,299 INFO L427 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1310990195, now seen corresponding path program 76 times [2020-02-10 20:12:56,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805609308] [2020-02-10 20:12:56,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:56,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:56,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805609308] [2020-02-10 20:12:56,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:56,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:56,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103061788] [2020-02-10 20:12:56,701 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:56,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:56,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:56,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:56,702 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:12:56,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:56,874 INFO L93 Difference]: Finished difference Result 1370 states and 4839 transitions. [2020-02-10 20:12:56,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:56,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:56,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:56,879 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:12:56,879 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:56,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:56,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:56,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 785. [2020-02-10 20:12:56,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:56,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:12:56,901 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:56,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:56,901 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:12:56,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:56,902 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:12:56,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:56,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:56,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:12:56,903 INFO L427 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:56,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1711661329, now seen corresponding path program 77 times [2020-02-10 20:12:56,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:56,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300171226] [2020-02-10 20:12:56,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300171226] [2020-02-10 20:12:57,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:57,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673497709] [2020-02-10 20:12:57,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:57,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:57,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:57,288 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:57,422 INFO L93 Difference]: Finished difference Result 1364 states and 4827 transitions. [2020-02-10 20:12:57,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:57,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:57,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:57,427 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:12:57,427 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:12:57,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:12:57,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:12:57,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:57,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:12:57,451 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:12:57,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:57,451 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:12:57,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:57,451 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:12:57,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:57,453 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:57,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, 1, 1, 1] [2020-02-10 20:12:57,453 INFO L427 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:57,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:57,453 INFO L82 PathProgramCache]: Analyzing trace with hash -972365009, now seen corresponding path program 78 times [2020-02-10 20:12:57,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:57,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736424628] [2020-02-10 20:12:57,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:57,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:57,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:57,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736424628] [2020-02-10 20:12:57,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:57,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:57,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955433101] [2020-02-10 20:12:57,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:57,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:57,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:57,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:57,850 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:12:58,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,008 INFO L93 Difference]: Finished difference Result 1368 states and 4832 transitions. [2020-02-10 20:12:58,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:58,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,012 INFO L225 Difference]: With dead ends: 1368 [2020-02-10 20:12:58,012 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:12:58,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:12:58,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 782. [2020-02-10 20:12:58,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:12:58,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:12:58,035 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:12:58,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,035 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:12:58,035 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:12:58,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:58,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,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, 1, 1, 1] [2020-02-10 20:12:58,037 INFO L427 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,037 INFO L82 PathProgramCache]: Analyzing trace with hash -355800525, now seen corresponding path program 79 times [2020-02-10 20:12:58,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429228507] [2020-02-10 20:12:58,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:58,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:58,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429228507] [2020-02-10 20:12:58,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:58,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:58,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104789555] [2020-02-10 20:12:58,450 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:58,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:58,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:58,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:58,451 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:12:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:58,613 INFO L93 Difference]: Finished difference Result 1360 states and 4822 transitions. [2020-02-10 20:12:58,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:58,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:58,617 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:12:58,617 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:12:58,617 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:58,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:12:58,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 788. [2020-02-10 20:12:58,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:12:58,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:12:58,640 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:12:58,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:58,640 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:12:58,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:12:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:58,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:58,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, 1, 1, 1] [2020-02-10 20:12:58,642 INFO L427 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:58,642 INFO L82 PathProgramCache]: Analyzing trace with hash 624954193, now seen corresponding path program 80 times [2020-02-10 20:12:58,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:58,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219302316] [2020-02-10 20:12:58,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219302316] [2020-02-10 20:12:59,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:59,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585274482] [2020-02-10 20:12:59,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:59,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:59,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:59,057 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:12:59,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,232 INFO L93 Difference]: Finished difference Result 1359 states and 4817 transitions. [2020-02-10 20:12:59,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:59,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:59,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,236 INFO L225 Difference]: With dead ends: 1359 [2020-02-10 20:12:59,236 INFO L226 Difference]: Without dead ends: 1344 [2020-02-10 20:12:59,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:59,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2020-02-10 20:12:59,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 785. [2020-02-10 20:12:59,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:12:59,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:12:59,283 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:12:59,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,283 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:12:59,283 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:59,283 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:12:59,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:59,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,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, 1, 1, 1] [2020-02-10 20:12:59,286 INFO L427 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,287 INFO L82 PathProgramCache]: Analyzing trace with hash -798699665, now seen corresponding path program 81 times [2020-02-10 20:12:59,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134693114] [2020-02-10 20:12:59,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:12:59,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:12:59,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134693114] [2020-02-10 20:12:59,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:12:59,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:12:59,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160193882] [2020-02-10 20:12:59,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:12:59,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:12:59,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:12:59,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:12:59,723 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:12:59,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:12:59,879 INFO L93 Difference]: Finished difference Result 1363 states and 4826 transitions. [2020-02-10 20:12:59,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:12:59,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:12:59,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:12:59,883 INFO L225 Difference]: With dead ends: 1363 [2020-02-10 20:12:59,884 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:12:59,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:12:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:12:59,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 789. [2020-02-10 20:12:59,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:12:59,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:12:59,908 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:12:59,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:12:59,909 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:12:59,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:12:59,909 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:12:59,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:12:59,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:12:59,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, 1, 1, 1] [2020-02-10 20:12:59,910 INFO L427 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:12:59,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:12:59,911 INFO L82 PathProgramCache]: Analyzing trace with hash 203061261, now seen corresponding path program 82 times [2020-02-10 20:12:59,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:12:59,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107137861] [2020-02-10 20:12:59,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:12:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:00,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107137861] [2020-02-10 20:13:00,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:00,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400997089] [2020-02-10 20:13:00,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:00,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:00,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:00,318 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:13:00,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:00,458 INFO L93 Difference]: Finished difference Result 1364 states and 4824 transitions. [2020-02-10 20:13:00,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:00,458 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:00,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:00,462 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:13:00,462 INFO L226 Difference]: Without dead ends: 1346 [2020-02-10 20:13:00,463 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:00,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2020-02-10 20:13:00,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 785. [2020-02-10 20:13:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:00,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:13:00,485 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:13:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:00,485 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:13:00,485 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:13:00,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:00,486 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:00,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, 1, 1, 1] [2020-02-10 20:13:00,487 INFO L427 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:00,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:00,487 INFO L82 PathProgramCache]: Analyzing trace with hash 1614771827, now seen corresponding path program 83 times [2020-02-10 20:13:00,487 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:00,487 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516247883] [2020-02-10 20:13:00,487 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:00,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 20:13:00,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516247883] [2020-02-10 20:13:00,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:00,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:00,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392322372] [2020-02-10 20:13:00,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:00,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:00,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:00,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:00,895 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:13:01,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,035 INFO L93 Difference]: Finished difference Result 1360 states and 4816 transitions. [2020-02-10 20:13:01,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:01,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:01,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,039 INFO L225 Difference]: With dead ends: 1360 [2020-02-10 20:13:01,039 INFO L226 Difference]: Without dead ends: 1348 [2020-02-10 20:13:01,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:01,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1348 states. [2020-02-10 20:13:01,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1348 to 788. [2020-02-10 20:13:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:01,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:13:01,062 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:13:01,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,062 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:13:01,062 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:01,062 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:13:01,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:01,063 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,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, 1, 1, 1] [2020-02-10 20:13:01,064 INFO L427 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,064 INFO L82 PathProgramCache]: Analyzing trace with hash 541686447, now seen corresponding path program 84 times [2020-02-10 20:13:01,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138126972] [2020-02-10 20:13:01,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:01,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:01,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138126972] [2020-02-10 20:13:01,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:01,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:01,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399504100] [2020-02-10 20:13:01,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:01,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:01,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:01,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:01,481 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:13:01,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:01,647 INFO L93 Difference]: Finished difference Result 1362 states and 4817 transitions. [2020-02-10 20:13:01,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:01,648 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:01,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:01,652 INFO L225 Difference]: With dead ends: 1362 [2020-02-10 20:13:01,652 INFO L226 Difference]: Without dead ends: 1342 [2020-02-10 20:13:01,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2020-02-10 20:13:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 782. [2020-02-10 20:13:01,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:01,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 20:13:01,676 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 20:13:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:01,676 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 20:13:01,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:01,676 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 20:13:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:01,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:01,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, 1, 1, 1] [2020-02-10 20:13:01,678 INFO L427 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:01,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:01,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1147747827, now seen corresponding path program 85 times [2020-02-10 20:13:01,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:01,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175420061] [2020-02-10 20:13:01,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175420061] [2020-02-10 20:13:02,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:02,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977439709] [2020-02-10 20:13:02,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:02,090 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:02,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:02,090 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:13:02,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,225 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 20:13:02,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:02,226 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:02,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,229 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:13:02,229 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:13:02,230 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:02,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:13:02,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 790. [2020-02-10 20:13:02,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:02,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 20:13:02,252 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 20:13:02,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,252 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 20:13:02,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:02,253 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 20:13:02,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:02,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,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, 1, 1, 1] [2020-02-10 20:13:02,254 INFO L427 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,254 INFO L82 PathProgramCache]: Analyzing trace with hash 2139005649, now seen corresponding path program 86 times [2020-02-10 20:13:02,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951687863] [2020-02-10 20:13:02,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:02,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:02,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951687863] [2020-02-10 20:13:02,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:02,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:02,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868625275] [2020-02-10 20:13:02,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:02,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:02,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:02,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:02,645 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:13:02,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:02,798 INFO L93 Difference]: Finished difference Result 1376 states and 4853 transitions. [2020-02-10 20:13:02,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:02,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:02,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:02,802 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:13:02,803 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:13:02,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:02,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:13:02,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 786. [2020-02-10 20:13:02,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:13:02,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3141 transitions. [2020-02-10 20:13:02,841 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3141 transitions. Word has length 25 [2020-02-10 20:13:02,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:02,841 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3141 transitions. [2020-02-10 20:13:02,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:02,841 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3141 transitions. [2020-02-10 20:13:02,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:02,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:02,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, 1, 1, 1] [2020-02-10 20:13:02,842 INFO L427 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:02,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:02,843 INFO L82 PathProgramCache]: Analyzing trace with hash -1221185391, now seen corresponding path program 87 times [2020-02-10 20:13:02,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:02,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010960666] [2020-02-10 20:13:02,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:02,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010960666] [2020-02-10 20:13:03,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:03,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907102397] [2020-02-10 20:13:03,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:03,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:03,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:03,246 INFO L87 Difference]: Start difference. First operand 786 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:13:03,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:03,400 INFO L93 Difference]: Finished difference Result 1371 states and 4843 transitions. [2020-02-10 20:13:03,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:03,401 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:03,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:03,405 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 20:13:03,405 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:13:03,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:03,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:13:03,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 20:13:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:03,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:13:03,428 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:13:03,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:03,428 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:13:03,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:03,428 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:13:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:03,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:03,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, 1, 1, 1] [2020-02-10 20:13:03,430 INFO L427 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:03,430 INFO L82 PathProgramCache]: Analyzing trace with hash -219424465, now seen corresponding path program 88 times [2020-02-10 20:13:03,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:03,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879443624] [2020-02-10 20:13:03,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:03,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:03,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:03,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879443624] [2020-02-10 20:13:03,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:03,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:03,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188468616] [2020-02-10 20:13:03,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:03,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:03,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:03,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:03,835 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:13:04,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,001 INFO L93 Difference]: Finished difference Result 1372 states and 4841 transitions. [2020-02-10 20:13:04,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:04,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:04,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,005 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:13:04,006 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:13:04,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:04,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:13:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 786. [2020-02-10 20:13:04,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:13:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 20:13:04,028 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 20:13:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,028 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 20:13:04,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:04,028 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 20:13:04,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:04,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,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, 1, 1, 1] [2020-02-10 20:13:04,030 INFO L427 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1166144013, now seen corresponding path program 89 times [2020-02-10 20:13:04,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645943301] [2020-02-10 20:13:04,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:04,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 20:13:04,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645943301] [2020-02-10 20:13:04,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:04,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:04,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600962452] [2020-02-10 20:13:04,428 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:04,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:04,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:04,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:04,429 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:13:04,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:04,592 INFO L93 Difference]: Finished difference Result 1378 states and 4854 transitions. [2020-02-10 20:13:04,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:04,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:04,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:04,596 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:13:04,596 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:13:04,597 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:04,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:13:04,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 791. [2020-02-10 20:13:04,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:04,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:13:04,620 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:13:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:04,620 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:13:04,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:04,621 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:13:04,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:04,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:04,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, 1, 1, 1] [2020-02-10 20:13:04,622 INFO L427 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:04,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:04,622 INFO L82 PathProgramCache]: Analyzing trace with hash 444796945, now seen corresponding path program 90 times [2020-02-10 20:13:04,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:04,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676115507] [2020-02-10 20:13:04,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:04,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676115507] [2020-02-10 20:13:05,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:05,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052941058] [2020-02-10 20:13:05,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:05,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:05,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:05,025 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:13:05,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,170 INFO L93 Difference]: Finished difference Result 1376 states and 4845 transitions. [2020-02-10 20:13:05,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:05,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,174 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:13:05,175 INFO L226 Difference]: Without dead ends: 1353 [2020-02-10 20:13:05,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:05,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2020-02-10 20:13:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 782. [2020-02-10 20:13:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:05,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:13:05,197 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:13:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,197 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:13:05,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:13:05,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:05,199 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,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, 1, 1, 1] [2020-02-10 20:13:05,199 INFO L427 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1963730385, now seen corresponding path program 91 times [2020-02-10 20:13:05,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262085156] [2020-02-10 20:13:05,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:05,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:05,580 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262085156] [2020-02-10 20:13:05,580 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:05,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:05,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954775850] [2020-02-10 20:13:05,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:05,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:05,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:05,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:05,581 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:13:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:05,742 INFO L93 Difference]: Finished difference Result 1366 states and 4829 transitions. [2020-02-10 20:13:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:05,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:05,746 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:13:05,746 INFO L226 Difference]: Without dead ends: 1354 [2020-02-10 20:13:05,747 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:05,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2020-02-10 20:13:05,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 788. [2020-02-10 20:13:05,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:05,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:13:05,769 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:13:05,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:05,769 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:13:05,769 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:13:05,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:05,771 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:05,771 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:05,771 INFO L427 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:05,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:05,771 INFO L82 PathProgramCache]: Analyzing trace with hash -352789427, now seen corresponding path program 92 times [2020-02-10 20:13:05,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:05,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838090424] [2020-02-10 20:13:05,772 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,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 20:13:06,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838090424] [2020-02-10 20:13:06,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:06,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420062904] [2020-02-10 20:13:06,205 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:06,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:06,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:06,206 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:13:06,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,351 INFO L93 Difference]: Finished difference Result 1370 states and 4834 transitions. [2020-02-10 20:13:06,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:06,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:06,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,355 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:13:06,355 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:13:06,355 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:06,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:13:06,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 785. [2020-02-10 20:13:06,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:06,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:13:06,378 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:13:06,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,379 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:13:06,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:06,379 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:13:06,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:06,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,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, 1, 1, 1] [2020-02-10 20:13:06,380 INFO L427 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,380 INFO L82 PathProgramCache]: Analyzing trace with hash 730799057, now seen corresponding path program 93 times [2020-02-10 20:13:06,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138407701] [2020-02-10 20:13:06,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:06,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:06,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138407701] [2020-02-10 20:13:06,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:06,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:06,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109107902] [2020-02-10 20:13:06,775 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:06,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:06,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:06,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:06,775 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:13:06,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:06,949 INFO L93 Difference]: Finished difference Result 1364 states and 4822 transitions. [2020-02-10 20:13:06,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:06,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:06,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:06,953 INFO L225 Difference]: With dead ends: 1364 [2020-02-10 20:13:06,953 INFO L226 Difference]: Without dead ends: 1352 [2020-02-10 20:13:06,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:06,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2020-02-10 20:13:06,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 788. [2020-02-10 20:13:06,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:13:06,976 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:13:06,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:06,976 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:13:06,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:06,976 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:13:06,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:06,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:06,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, 1, 1, 1] [2020-02-10 20:13:06,978 INFO L427 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:06,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:06,978 INFO L82 PathProgramCache]: Analyzing trace with hash -342286323, now seen corresponding path program 94 times [2020-02-10 20:13:06,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:06,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706640733] [2020-02-10 20:13:06,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706640733] [2020-02-10 20:13:07,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:07,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377791320] [2020-02-10 20:13:07,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:07,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:07,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:07,359 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:13:07,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:07,510 INFO L93 Difference]: Finished difference Result 1366 states and 4823 transitions. [2020-02-10 20:13:07,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:07,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:07,515 INFO L225 Difference]: With dead ends: 1366 [2020-02-10 20:13:07,515 INFO L226 Difference]: Without dead ends: 1349 [2020-02-10 20:13:07,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:07,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2020-02-10 20:13:07,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 785. [2020-02-10 20:13:07,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:07,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 20:13:07,538 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 20:13:07,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:07,538 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 20:13:07,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:07,538 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 20:13:07,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:07,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:07,540 INFO L427 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:07,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:07,540 INFO L82 PathProgramCache]: Analyzing trace with hash 741302161, now seen corresponding path program 95 times [2020-02-10 20:13:07,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:07,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216920106] [2020-02-10 20:13:07,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:07,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:07,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:07,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216920106] [2020-02-10 20:13:07,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:07,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:07,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015041228] [2020-02-10 20:13:07,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:07,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:07,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:07,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:07,954 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:13:08,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,142 INFO L93 Difference]: Finished difference Result 1374 states and 4841 transitions. [2020-02-10 20:13:08,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:08,142 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:08,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,146 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:13:08,146 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:13:08,147 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:08,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:13:08,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 790. [2020-02-10 20:13:08,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:08,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 20:13:08,169 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 20:13:08,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,169 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 20:13:08,170 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:08,170 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 20:13:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:08,171 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:08,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, 1, 1, 1] [2020-02-10 20:13:08,171 INFO L427 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1942724177, now seen corresponding path program 96 times [2020-02-10 20:13:08,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645288137] [2020-02-10 20:13:08,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:08,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:08,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645288137] [2020-02-10 20:13:08,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:08,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:08,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604938451] [2020-02-10 20:13:08,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:08,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:08,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:08,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:08,556 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:13:08,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:08,728 INFO L93 Difference]: Finished difference Result 1372 states and 4832 transitions. [2020-02-10 20:13:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:08,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:08,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:08,733 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:13:08,733 INFO L226 Difference]: Without dead ends: 1347 [2020-02-10 20:13:08,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:08,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2020-02-10 20:13:08,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 779. [2020-02-10 20:13:08,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:13:08,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3119 transitions. [2020-02-10 20:13:08,755 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3119 transitions. Word has length 25 [2020-02-10 20:13:08,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:08,756 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3119 transitions. [2020-02-10 20:13:08,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:08,756 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3119 transitions. [2020-02-10 20:13:08,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:08,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:08,757 INFO L427 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:08,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:08,757 INFO L82 PathProgramCache]: Analyzing trace with hash 2073967317, now seen corresponding path program 97 times [2020-02-10 20:13:08,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:08,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505534641] [2020-02-10 20:13:08,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505534641] [2020-02-10 20:13:09,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:09,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973233502] [2020-02-10 20:13:09,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:09,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:09,171 INFO L87 Difference]: Start difference. First operand 779 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:13:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,333 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 20:13:09,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:09,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,337 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:13:09,338 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 20:13:09,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:09,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 20:13:09,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 788. [2020-02-10 20:13:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:09,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3149 transitions. [2020-02-10 20:13:09,365 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3149 transitions. Word has length 25 [2020-02-10 20:13:09,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,365 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3149 transitions. [2020-02-10 20:13:09,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:09,365 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3149 transitions. [2020-02-10 20:13:09,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:09,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,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, 1, 1, 1] [2020-02-10 20:13:09,366 INFO L427 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,367 INFO L82 PathProgramCache]: Analyzing trace with hash -610059021, now seen corresponding path program 98 times [2020-02-10 20:13:09,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375282543] [2020-02-10 20:13:09,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:09,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375282543] [2020-02-10 20:13:09,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:09,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:09,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474230974] [2020-02-10 20:13:09,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:09,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:09,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:09,759 INFO L87 Difference]: Start difference. First operand 788 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:13:09,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:09,903 INFO L93 Difference]: Finished difference Result 1373 states and 4852 transitions. [2020-02-10 20:13:09,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:09,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:09,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:09,907 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:13:09,907 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:13:09,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:09,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:13:09,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 785. [2020-02-10 20:13:09,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:09,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3141 transitions. [2020-02-10 20:13:09,930 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3141 transitions. Word has length 25 [2020-02-10 20:13:09,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:09,930 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3141 transitions. [2020-02-10 20:13:09,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3141 transitions. [2020-02-10 20:13:09,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:09,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:09,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, 1, 1, 1] [2020-02-10 20:13:09,931 INFO L427 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:09,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:09,932 INFO L82 PathProgramCache]: Analyzing trace with hash 473529463, now seen corresponding path program 99 times [2020-02-10 20:13:09,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:09,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831150357] [2020-02-10 20:13:09,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:09,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,330 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831150357] [2020-02-10 20:13:10,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:10,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067350164] [2020-02-10 20:13:10,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:10,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:10,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:10,331 INFO L87 Difference]: Start difference. First operand 785 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:13:10,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:10,477 INFO L93 Difference]: Finished difference Result 1383 states and 4875 transitions. [2020-02-10 20:13:10,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:10,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:10,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:10,482 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:13:10,482 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:13:10,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:10,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:13:10,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 791. [2020-02-10 20:13:10,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:10,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 20:13:10,504 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 20:13:10,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:10,505 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 20:13:10,505 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:10,505 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 20:13:10,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:10,506 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:10,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, 1, 1, 1] [2020-02-10 20:13:10,506 INFO L427 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:10,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:10,506 INFO L82 PathProgramCache]: Analyzing trace with hash -599555917, now seen corresponding path program 100 times [2020-02-10 20:13:10,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:10,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306292855] [2020-02-10 20:13:10,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:10,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:10,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306292855] [2020-02-10 20:13:10,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:10,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:10,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805162754] [2020-02-10 20:13:10,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:10,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:10,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:10,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:10,926 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:13:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,090 INFO L93 Difference]: Finished difference Result 1384 states and 4871 transitions. [2020-02-10 20:13:11,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:11,091 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:11,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,095 INFO L225 Difference]: With dead ends: 1384 [2020-02-10 20:13:11,095 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:13:11,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:13:11,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 785. [2020-02-10 20:13:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:13:11,120 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:13:11,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,120 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:13:11,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:11,120 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:13:11,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:11,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,122 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:11,122 INFO L427 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,122 INFO L82 PathProgramCache]: Analyzing trace with hash 484032567, now seen corresponding path program 101 times [2020-02-10 20:13:11,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591288989] [2020-02-10 20:13:11,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:11,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:11,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591288989] [2020-02-10 20:13:11,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:11,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:11,522 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858746324] [2020-02-10 20:13:11,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:11,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:11,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:11,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:11,523 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:13:11,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:11,658 INFO L93 Difference]: Finished difference Result 1374 states and 4851 transitions. [2020-02-10 20:13:11,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:11,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:11,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:11,662 INFO L225 Difference]: With dead ends: 1374 [2020-02-10 20:13:11,662 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:13:11,662 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:11,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:13:11,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 788. [2020-02-10 20:13:11,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:11,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3143 transitions. [2020-02-10 20:13:11,685 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3143 transitions. Word has length 25 [2020-02-10 20:13:11,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:11,685 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3143 transitions. [2020-02-10 20:13:11,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:11,685 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3143 transitions. [2020-02-10 20:13:11,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:11,686 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:11,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, 1, 1, 1] [2020-02-10 20:13:11,686 INFO L427 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:11,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:11,687 INFO L82 PathProgramCache]: Analyzing trace with hash 2094973525, now seen corresponding path program 102 times [2020-02-10 20:13:11,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:11,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811216699] [2020-02-10 20:13:11,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:11,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811216699] [2020-02-10 20:13:12,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:12,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310960998] [2020-02-10 20:13:12,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:12,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:12,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:12,088 INFO L87 Difference]: Start difference. First operand 788 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:13:12,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,243 INFO L93 Difference]: Finished difference Result 1378 states and 4856 transitions. [2020-02-10 20:13:12,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:12,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:12,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,247 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:13:12,247 INFO L226 Difference]: Without dead ends: 1356 [2020-02-10 20:13:12,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:12,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2020-02-10 20:13:12,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 782. [2020-02-10 20:13:12,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:12,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3130 transitions. [2020-02-10 20:13:12,273 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3130 transitions. Word has length 25 [2020-02-10 20:13:12,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,273 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3130 transitions. [2020-02-10 20:13:12,273 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:12,273 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3130 transitions. [2020-02-10 20:13:12,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:12,275 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,275 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:12,275 INFO L427 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,275 INFO L82 PathProgramCache]: Analyzing trace with hash -294965901, now seen corresponding path program 103 times [2020-02-10 20:13:12,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750060448] [2020-02-10 20:13:12,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:12,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:12,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750060448] [2020-02-10 20:13:12,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:12,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:12,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932390461] [2020-02-10 20:13:12,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:12,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:12,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:12,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:12,679 INFO L87 Difference]: Start difference. First operand 782 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:13:12,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:12,843 INFO L93 Difference]: Finished difference Result 1373 states and 4851 transitions. [2020-02-10 20:13:12,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:12,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:12,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:12,847 INFO L225 Difference]: With dead ends: 1373 [2020-02-10 20:13:12,847 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:13:12,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:12,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:13:12,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:13:12,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:12,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:13:12,870 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:13:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:12,870 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:13:12,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:12,870 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:13:12,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:12,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:12,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, 1, 1, 1] [2020-02-10 20:13:12,872 INFO L427 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:12,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:12,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1315975057, now seen corresponding path program 104 times [2020-02-10 20:13:12,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:12,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117511214] [2020-02-10 20:13:12,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:12,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117511214] [2020-02-10 20:13:13,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:13,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168834752] [2020-02-10 20:13:13,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:13,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:13,296 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:13:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:13,447 INFO L93 Difference]: Finished difference Result 1370 states and 4842 transitions. [2020-02-10 20:13:13,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:13,448 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:13,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:13,451 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:13:13,451 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:13:13,452 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:13:13,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 20:13:13,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:13,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3138 transitions. [2020-02-10 20:13:13,474 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3138 transitions. Word has length 25 [2020-02-10 20:13:13,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:13,474 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3138 transitions. [2020-02-10 20:13:13,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:13,474 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3138 transitions. [2020-02-10 20:13:13,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:13,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13: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, 1, 1, 1] [2020-02-10 20:13:13,476 INFO L427 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:13,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:13,477 INFO L82 PathProgramCache]: Analyzing trace with hash 799125687, now seen corresponding path program 105 times [2020-02-10 20:13:13,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:13,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070099822] [2020-02-10 20:13:13,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:13,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:13,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070099822] [2020-02-10 20:13:13,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:13,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:13,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016785439] [2020-02-10 20:13:13,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:13,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:13,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:13,916 INFO L87 Difference]: Start difference. First operand 785 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:13:14,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,072 INFO L93 Difference]: Finished difference Result 1377 states and 4858 transitions. [2020-02-10 20:13:14,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:14,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:14,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,076 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:13:14,076 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:13:14,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:14,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:13:14,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 790. [2020-02-10 20:13:14,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 20:13:14,104 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 20:13:14,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,104 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 20:13:14,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:14,104 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 20:13:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:14,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,106 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:14,106 INFO L427 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,106 INFO L82 PathProgramCache]: Analyzing trace with hash 1336981265, now seen corresponding path program 106 times [2020-02-10 20:13:14,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223622874] [2020-02-10 20:13:14,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:14,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:14,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223622874] [2020-02-10 20:13:14,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:14,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:14,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107007820] [2020-02-10 20:13:14,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:14,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:14,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:14,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:14,516 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:13:14,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:14,662 INFO L93 Difference]: Finished difference Result 1376 states and 4851 transitions. [2020-02-10 20:13:14,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:14,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:14,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:14,666 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:13:14,667 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:13:14,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:14,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:13:14,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 20:13:14,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:14,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:13:14,689 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:13:14,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:14,689 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:13:14,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:14,690 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:13:14,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:14,691 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:14,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, 1, 1, 1] [2020-02-10 20:13:14,691 INFO L427 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:14,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:14,691 INFO L82 PathProgramCache]: Analyzing trace with hash 809628791, now seen corresponding path program 107 times [2020-02-10 20:13:14,691 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:14,691 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322525432] [2020-02-10 20:13:14,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:14,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322525432] [2020-02-10 20:13:15,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:15,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590345415] [2020-02-10 20:13:15,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:15,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:15,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:15,080 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:13:15,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,238 INFO L93 Difference]: Finished difference Result 1369 states and 4837 transitions. [2020-02-10 20:13:15,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:15,238 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:15,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,242 INFO L225 Difference]: With dead ends: 1369 [2020-02-10 20:13:15,242 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:13:15,242 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:15,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:13:15,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 788. [2020-02-10 20:13:15,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:15,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:13:15,264 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:13:15,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,264 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:13:15,264 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:13:15,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:15,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,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, 1, 1, 1] [2020-02-10 20:13:15,265 INFO L427 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,266 INFO L82 PathProgramCache]: Analyzing trace with hash -263456589, now seen corresponding path program 108 times [2020-02-10 20:13:15,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155954311] [2020-02-10 20:13:15,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:15,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155954311] [2020-02-10 20:13:15,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126921496] [2020-02-10 20:13:15,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:15,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:15,673 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:13:15,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:15,827 INFO L93 Difference]: Finished difference Result 1371 states and 4838 transitions. [2020-02-10 20:13:15,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:15,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:15,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:15,831 INFO L225 Difference]: With dead ends: 1371 [2020-02-10 20:13:15,831 INFO L226 Difference]: Without dead ends: 1351 [2020-02-10 20:13:15,832 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:15,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2020-02-10 20:13:15,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 782. [2020-02-10 20:13:15,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:15,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:13:15,854 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:13:15,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:15,854 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:13:15,854 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:15,854 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:13:15,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:15,855 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:15,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, 1, 1, 1] [2020-02-10 20:13:15,856 INFO L427 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:15,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:15,856 INFO L82 PathProgramCache]: Analyzing trace with hash 30630323, now seen corresponding path program 109 times [2020-02-10 20:13:15,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:15,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272001300] [2020-02-10 20:13:15,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272001300] [2020-02-10 20:13:16,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:16,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223675322] [2020-02-10 20:13:16,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:16,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:16,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:16,292 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:13:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:16,473 INFO L93 Difference]: Finished difference Result 1391 states and 4896 transitions. [2020-02-10 20:13:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:16,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:16,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:16,478 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:13:16,478 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:13:16,478 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:16,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:13:16,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 793. [2020-02-10 20:13:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:16,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:13:16,502 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:13:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:16,502 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:13:16,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:16,503 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:13:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:16,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:16,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, 1, 1, 1] [2020-02-10 20:13:16,504 INFO L427 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:16,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:16,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1042455057, now seen corresponding path program 110 times [2020-02-10 20:13:16,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:16,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874066071] [2020-02-10 20:13:16,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:16,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:16,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:16,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874066071] [2020-02-10 20:13:16,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:16,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:16,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566776159] [2020-02-10 20:13:16,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:16,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:16,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:16,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:16,913 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:13:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,065 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 20:13:17,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:17,066 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:17,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,070 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:13:17,070 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:13:17,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:17,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:13:17,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:13:17,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:13:17,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:13:17,092 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:13:17,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,093 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:13:17,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:17,093 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:13:17,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:17,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,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, 1, 1, 1] [2020-02-10 20:13:17,094 INFO L427 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1569807531, now seen corresponding path program 111 times [2020-02-10 20:13:17,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366832700] [2020-02-10 20:13:17,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:17,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 20:13:17,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366832700] [2020-02-10 20:13:17,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:17,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:17,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768356558] [2020-02-10 20:13:17,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:17,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:17,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:17,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:17,498 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:13:17,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:17,649 INFO L93 Difference]: Finished difference Result 1388 states and 4884 transitions. [2020-02-10 20:13:17,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:17,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:17,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:17,653 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:13:17,653 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:13:17,653 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:17,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:13:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 792. [2020-02-10 20:13:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:17,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3150 transitions. [2020-02-10 20:13:17,676 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3150 transitions. Word has length 25 [2020-02-10 20:13:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:17,676 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3150 transitions. [2020-02-10 20:13:17,676 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:17,676 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3150 transitions. [2020-02-10 20:13:17,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:17,677 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:17,677 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:17,677 INFO L427 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:17,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:17,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1031951953, now seen corresponding path program 112 times [2020-02-10 20:13:17,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:17,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121616317] [2020-02-10 20:13:17,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121616317] [2020-02-10 20:13:18,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:18,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294988874] [2020-02-10 20:13:18,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:18,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:18,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:18,078 INFO L87 Difference]: Start difference. First operand 792 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:13:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,226 INFO L93 Difference]: Finished difference Result 1387 states and 4877 transitions. [2020-02-10 20:13:18,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:18,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,231 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:13:18,231 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:13:18,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:18,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:13:18,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 787. [2020-02-10 20:13:18,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:13:18,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 20:13:18,253 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 20:13:18,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,254 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 20:13:18,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:18,254 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 20:13:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:18,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,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, 1, 1, 1] [2020-02-10 20:13:18,255 INFO L427 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1548801323, now seen corresponding path program 113 times [2020-02-10 20:13:18,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138834652] [2020-02-10 20:13:18,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:18,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:18,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138834652] [2020-02-10 20:13:18,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:18,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:18,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052604576] [2020-02-10 20:13:18,665 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:18,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:18,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:18,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:18,665 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:13:18,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:18,805 INFO L93 Difference]: Finished difference Result 1390 states and 4883 transitions. [2020-02-10 20:13:18,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:18,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:18,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:18,810 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:13:18,810 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:13:18,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:13:18,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 792. [2020-02-10 20:13:18,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:18,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:13:18,835 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:13:18,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:18,836 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:13:18,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:18,836 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:13:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:18,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:18,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:18,838 INFO L427 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:18,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:18,838 INFO L82 PathProgramCache]: Analyzing trace with hash 62139635, now seen corresponding path program 114 times [2020-02-10 20:13:18,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:18,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127913110] [2020-02-10 20:13:18,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:19,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127913110] [2020-02-10 20:13:19,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:19,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837188694] [2020-02-10 20:13:19,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:19,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:19,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:19,237 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:13:19,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,409 INFO L93 Difference]: Finished difference Result 1388 states and 4874 transitions. [2020-02-10 20:13:19,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:19,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:19,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,413 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:13:19,413 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:13:19,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:19,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:13:19,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 782. [2020-02-10 20:13:19,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:19,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 20:13:19,436 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 20:13:19,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,436 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 20:13:19,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:19,436 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 20:13:19,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:19,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,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, 1, 1, 1] [2020-02-10 20:13:19,437 INFO L427 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1967167505, now seen corresponding path program 115 times [2020-02-10 20:13:19,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145532220] [2020-02-10 20:13:19,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:19,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 20:13:19,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145532220] [2020-02-10 20:13:19,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:19,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:19,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206380784] [2020-02-10 20:13:19,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:19,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:19,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:19,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:19,812 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:13:19,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:19,956 INFO L93 Difference]: Finished difference Result 1372 states and 4843 transitions. [2020-02-10 20:13:19,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:19,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:19,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:19,960 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:13:19,961 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:13:19,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:19,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:13:19,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 788. [2020-02-10 20:13:19,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3140 transitions. [2020-02-10 20:13:19,983 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3140 transitions. Word has length 25 [2020-02-10 20:13:19,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:19,983 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3140 transitions. [2020-02-10 20:13:19,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:19,983 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3140 transitions. [2020-02-10 20:13:19,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:19,984 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:19,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, 1, 1, 1] [2020-02-10 20:13:19,985 INFO L427 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:19,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:19,985 INFO L82 PathProgramCache]: Analyzing trace with hash -716858833, now seen corresponding path program 116 times [2020-02-10 20:13:19,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:19,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441310122] [2020-02-10 20:13:19,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:19,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:20,504 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 20:13:20,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:20,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441310122] [2020-02-10 20:13:20,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:20,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:20,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231936861] [2020-02-10 20:13:20,513 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:20,513 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:20,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:20,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:20,514 INFO L87 Difference]: Start difference. First operand 788 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:13:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:20,692 INFO L93 Difference]: Finished difference Result 1376 states and 4848 transitions. [2020-02-10 20:13:20,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:20,692 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:20,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:20,695 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:13:20,696 INFO L226 Difference]: Without dead ends: 1357 [2020-02-10 20:13:20,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:20,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1357 states. [2020-02-10 20:13:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1357 to 785. [2020-02-10 20:13:20,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:20,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3132 transitions. [2020-02-10 20:13:20,729 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3132 transitions. Word has length 25 [2020-02-10 20:13:20,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:20,730 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3132 transitions. [2020-02-10 20:13:20,730 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:20,730 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3132 transitions. [2020-02-10 20:13:20,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:20,731 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:20,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, 1, 1, 1] [2020-02-10 20:13:20,732 INFO L427 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:20,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:20,732 INFO L82 PathProgramCache]: Analyzing trace with hash 366729651, now seen corresponding path program 117 times [2020-02-10 20:13:20,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:20,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094220507] [2020-02-10 20:13:20,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094220507] [2020-02-10 20:13:21,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:21,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173039810] [2020-02-10 20:13:21,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:21,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:21,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:21,121 INFO L87 Difference]: Start difference. First operand 785 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:13:21,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,288 INFO L93 Difference]: Finished difference Result 1370 states and 4836 transitions. [2020-02-10 20:13:21,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:21,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:21,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,292 INFO L225 Difference]: With dead ends: 1370 [2020-02-10 20:13:21,292 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:13:21,293 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:21,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:13:21,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 788. [2020-02-10 20:13:21,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:21,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 20:13:21,315 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 20:13:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,315 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 20:13:21,315 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 20:13:21,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:21,316 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,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, 1, 1, 1] [2020-02-10 20:13:21,316 INFO L427 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,317 INFO L82 PathProgramCache]: Analyzing trace with hash -706355729, now seen corresponding path program 118 times [2020-02-10 20:13:21,317 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267147593] [2020-02-10 20:13:21,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:21,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:21,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267147593] [2020-02-10 20:13:21,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:21,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:21,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876354187] [2020-02-10 20:13:21,716 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:21,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:21,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:21,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:21,717 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:13:21,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:21,884 INFO L93 Difference]: Finished difference Result 1372 states and 4837 transitions. [2020-02-10 20:13:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:21,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:21,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:21,889 INFO L225 Difference]: With dead ends: 1372 [2020-02-10 20:13:21,889 INFO L226 Difference]: Without dead ends: 1355 [2020-02-10 20:13:21,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:21,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2020-02-10 20:13:21,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 785. [2020-02-10 20:13:21,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:21,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 20:13:21,913 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 20:13:21,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:21,913 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 20:13:21,913 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:21,913 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 20:13:21,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:21,914 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:21,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, 1, 1, 1] [2020-02-10 20:13:21,914 INFO L427 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:21,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:21,915 INFO L82 PathProgramCache]: Analyzing trace with hash 377232755, now seen corresponding path program 119 times [2020-02-10 20:13:21,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:21,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966233647] [2020-02-10 20:13:21,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:22,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966233647] [2020-02-10 20:13:22,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:22,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199990063] [2020-02-10 20:13:22,320 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:22,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:22,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:22,321 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:13:22,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:22,494 INFO L93 Difference]: Finished difference Result 1380 states and 4855 transitions. [2020-02-10 20:13:22,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:22,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:22,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:22,498 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:13:22,498 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:13:22,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:22,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:13:22,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 790. [2020-02-10 20:13:22,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:22,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3138 transitions. [2020-02-10 20:13:22,521 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3138 transitions. Word has length 25 [2020-02-10 20:13:22,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:22,521 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3138 transitions. [2020-02-10 20:13:22,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:22,521 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3138 transitions. [2020-02-10 20:13:22,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:22,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:22,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:22,523 INFO L427 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:22,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:22,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1988173713, now seen corresponding path program 120 times [2020-02-10 20:13:22,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:22,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165110341] [2020-02-10 20:13:22,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:22,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 20:13:22,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165110341] [2020-02-10 20:13:22,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:22,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:22,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549575419] [2020-02-10 20:13:22,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:22,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:22,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:22,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:22,931 INFO L87 Difference]: Start difference. First operand 790 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:13:23,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,081 INFO L93 Difference]: Finished difference Result 1378 states and 4846 transitions. [2020-02-10 20:13:23,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:23,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:23,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,085 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:13:23,085 INFO L226 Difference]: Without dead ends: 1350 [2020-02-10 20:13:23,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2020-02-10 20:13:23,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 776. [2020-02-10 20:13:23,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:13:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3111 transitions. [2020-02-10 20:13:23,109 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3111 transitions. Word has length 25 [2020-02-10 20:13:23,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,109 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3111 transitions. [2020-02-10 20:13:23,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3111 transitions. [2020-02-10 20:13:23,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:23,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:23,111 INFO L427 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1635199863, now seen corresponding path program 121 times [2020-02-10 20:13:23,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368939469] [2020-02-10 20:13:23,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:23,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:23,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368939469] [2020-02-10 20:13:23,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:23,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:23,505 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344195251] [2020-02-10 20:13:23,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:23,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:23,506 INFO L87 Difference]: Start difference. First operand 776 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:13:23,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:23,658 INFO L93 Difference]: Finished difference Result 1402 states and 4942 transitions. [2020-02-10 20:13:23,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:23,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:23,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:23,663 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:13:23,663 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:13:23,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:23,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:13:23,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 792. [2020-02-10 20:13:23,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:23,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3172 transitions. [2020-02-10 20:13:23,687 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3172 transitions. Word has length 25 [2020-02-10 20:13:23,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:23,687 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3172 transitions. [2020-02-10 20:13:23,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:23,687 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3172 transitions. [2020-02-10 20:13:23,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:23,689 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:23,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, 1, 1, 1] [2020-02-10 20:13:23,689 INFO L427 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:23,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:23,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1689515819, now seen corresponding path program 122 times [2020-02-10 20:13:23,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:23,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655171035] [2020-02-10 20:13:23,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:23,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655171035] [2020-02-10 20:13:24,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:24,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678420304] [2020-02-10 20:13:24,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:24,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:24,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:24,082 INFO L87 Difference]: Start difference. First operand 792 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:13:24,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,251 INFO L93 Difference]: Finished difference Result 1404 states and 4942 transitions. [2020-02-10 20:13:24,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:24,251 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:24,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,254 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:13:24,254 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:13:24,255 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:24,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:13:24,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:13:24,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:24,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3162 transitions. [2020-02-10 20:13:24,277 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3162 transitions. Word has length 25 [2020-02-10 20:13:24,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,277 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3162 transitions. [2020-02-10 20:13:24,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:24,277 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3162 transitions. [2020-02-10 20:13:24,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:24,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,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, 1, 1, 1] [2020-02-10 20:13:24,278 INFO L427 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,279 INFO L82 PathProgramCache]: Analyzing trace with hash -733733355, now seen corresponding path program 123 times [2020-02-10 20:13:24,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609731679] [2020-02-10 20:13:24,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:24,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:24,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609731679] [2020-02-10 20:13:24,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:24,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:24,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546091487] [2020-02-10 20:13:24,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:24,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:24,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:24,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:24,699 INFO L87 Difference]: Start difference. First operand 788 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:13:24,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:24,870 INFO L93 Difference]: Finished difference Result 1398 states and 4930 transitions. [2020-02-10 20:13:24,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:24,871 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:24,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:24,874 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:13:24,875 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:13:24,875 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:24,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:13:24,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 791. [2020-02-10 20:13:24,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:24,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3167 transitions. [2020-02-10 20:13:24,898 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3167 transitions. Word has length 25 [2020-02-10 20:13:24,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:24,898 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3167 transitions. [2020-02-10 20:13:24,898 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:24,898 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3167 transitions. [2020-02-10 20:13:24,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:24,899 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:24,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, 1, 1, 1] [2020-02-10 20:13:24,899 INFO L427 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:24,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:24,900 INFO L82 PathProgramCache]: Analyzing trace with hash 247021363, now seen corresponding path program 124 times [2020-02-10 20:13:24,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:24,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474172520] [2020-02-10 20:13:24,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:24,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474172520] [2020-02-10 20:13:25,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:25,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004137853] [2020-02-10 20:13:25,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:25,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:25,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:25,404 INFO L87 Difference]: Start difference. First operand 791 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:13:25,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:25,577 INFO L93 Difference]: Finished difference Result 1397 states and 4925 transitions. [2020-02-10 20:13:25,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:25,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:25,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:25,581 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:13:25,581 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:13:25,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:25,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:13:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 20:13:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3159 transitions. [2020-02-10 20:13:25,604 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3159 transitions. Word has length 25 [2020-02-10 20:13:25,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:25,604 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3159 transitions. [2020-02-10 20:13:25,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:25,604 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3159 transitions. [2020-02-10 20:13:25,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:25,605 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:25,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, 1, 1, 1] [2020-02-10 20:13:25,606 INFO L427 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:25,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:25,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1350890633, now seen corresponding path program 125 times [2020-02-10 20:13:25,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:25,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515663952] [2020-02-10 20:13:25,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:25,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:25,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:25,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515663952] [2020-02-10 20:13:25,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:25,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:25,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027114091] [2020-02-10 20:13:25,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:25,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:25,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:25,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:25,996 INFO L87 Difference]: Start difference. First operand 788 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:13:26,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,153 INFO L93 Difference]: Finished difference Result 1402 states and 4935 transitions. [2020-02-10 20:13:26,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:26,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:26,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,158 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:13:26,158 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:13:26,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:13:26,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 791. [2020-02-10 20:13:26,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:26,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 20:13:26,182 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 20:13:26,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,182 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 20:13:26,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:26,182 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 20:13:26,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:26,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,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, 1, 1, 1] [2020-02-10 20:13:26,183 INFO L427 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,184 INFO L82 PathProgramCache]: Analyzing trace with hash 260050325, now seen corresponding path program 126 times [2020-02-10 20:13:26,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244628125] [2020-02-10 20:13:26,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:26,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:26,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244628125] [2020-02-10 20:13:26,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:26,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:26,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607834208] [2020-02-10 20:13:26,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:26,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:26,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:26,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:26,716 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:13:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:26,895 INFO L93 Difference]: Finished difference Result 1399 states and 4926 transitions. [2020-02-10 20:13:26,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:26,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:26,901 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:13:26,901 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:13:26,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:26,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:13:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 785. [2020-02-10 20:13:26,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:26,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3151 transitions. [2020-02-10 20:13:26,956 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3151 transitions. Word has length 25 [2020-02-10 20:13:26,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:26,957 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3151 transitions. [2020-02-10 20:13:26,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:26,957 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3151 transitions. [2020-02-10 20:13:26,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:26,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:26,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, 1, 1, 1] [2020-02-10 20:13:26,960 INFO L427 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:26,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:26,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1212714137, now seen corresponding path program 127 times [2020-02-10 20:13:26,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:26,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768138811] [2020-02-10 20:13:26,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:27,387 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:13:27,526 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:13:27,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:27,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768138811] [2020-02-10 20:13:27,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:27,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:27,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360877732] [2020-02-10 20:13:27,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:27,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:27,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:27,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:27,533 INFO L87 Difference]: Start difference. First operand 785 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:13:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:27,780 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 20:13:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:27,781 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:27,786 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:13:27,786 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:13:27,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:13:27,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:13:27,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:27,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 20:13:27,843 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 20:13:27,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:27,843 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 20:13:27,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:27,844 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 20:13:27,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:27,846 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:27,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, 1, 1, 1] [2020-02-10 20:13:27,847 INFO L427 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:27,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:27,847 INFO L82 PathProgramCache]: Analyzing trace with hash -2112001545, now seen corresponding path program 128 times [2020-02-10 20:13:27,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:27,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113146994] [2020-02-10 20:13:27,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:28,301 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:13:28,443 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:13:28,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:28,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113146994] [2020-02-10 20:13:28,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:28,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201206426] [2020-02-10 20:13:28,454 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:28,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:28,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:28,455 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:13:28,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:28,644 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 20:13:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:28,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:28,648 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:13:28,648 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:13:28,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:28,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:13:28,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:13:28,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:13:28,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3162 transitions. [2020-02-10 20:13:28,681 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3162 transitions. Word has length 25 [2020-02-10 20:13:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:28,681 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3162 transitions. [2020-02-10 20:13:28,681 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3162 transitions. [2020-02-10 20:13:28,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:28,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:28,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, 1, 1, 1] [2020-02-10 20:13:28,683 INFO L427 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:28,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:28,683 INFO L82 PathProgramCache]: Analyzing trace with hash 769814997, now seen corresponding path program 129 times [2020-02-10 20:13:28,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:28,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472407575] [2020-02-10 20:13:28,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:29,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472407575] [2020-02-10 20:13:29,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:29,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076439694] [2020-02-10 20:13:29,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:29,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:29,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:29,074 INFO L87 Difference]: Start difference. First operand 789 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:13:29,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,224 INFO L93 Difference]: Finished difference Result 1412 states and 4961 transitions. [2020-02-10 20:13:29,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:29,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:29,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,228 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:13:29,229 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:13:29,229 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:13:29,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 793. [2020-02-10 20:13:29,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 20:13:29,251 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 20:13:29,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,251 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 20:13:29,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:29,251 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 20:13:29,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:29,252 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,252 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:29,252 INFO L427 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1761072819, now seen corresponding path program 130 times [2020-02-10 20:13:29,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602583094] [2020-02-10 20:13:29,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:29,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 20:13:29,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602583094] [2020-02-10 20:13:29,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:29,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:29,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278658321] [2020-02-10 20:13:29,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:29,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:29,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:29,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:29,681 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:13:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:29,881 INFO L93 Difference]: Finished difference Result 1415 states and 4963 transitions. [2020-02-10 20:13:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:29,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:29,885 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:13:29,885 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:13:29,886 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:29,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:13:29,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 789. [2020-02-10 20:13:29,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:13:29,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3158 transitions. [2020-02-10 20:13:29,911 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3158 transitions. Word has length 25 [2020-02-10 20:13:29,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:29,911 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3158 transitions. [2020-02-10 20:13:29,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:29,912 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3158 transitions. [2020-02-10 20:13:29,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:29,913 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:29,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, 1, 1, 1] [2020-02-10 20:13:29,913 INFO L427 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:29,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1447780135, now seen corresponding path program 131 times [2020-02-10 20:13:29,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:29,914 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122189704] [2020-02-10 20:13:29,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122189704] [2020-02-10 20:13:30,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:30,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044397450] [2020-02-10 20:13:30,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:30,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:30,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:30,307 INFO L87 Difference]: Start difference. First operand 789 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:13:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:30,455 INFO L93 Difference]: Finished difference Result 1418 states and 4971 transitions. [2020-02-10 20:13:30,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:30,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:30,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:30,459 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:13:30,459 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:13:30,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:30,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:13:30,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 795. [2020-02-10 20:13:30,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:13:30,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3169 transitions. [2020-02-10 20:13:30,482 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3169 transitions. Word has length 25 [2020-02-10 20:13:30,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:30,482 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3169 transitions. [2020-02-10 20:13:30,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:30,482 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3169 transitions. [2020-02-10 20:13:30,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:30,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:30,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, 1, 1, 1] [2020-02-10 20:13:30,484 INFO L427 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:30,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:30,484 INFO L82 PathProgramCache]: Analyzing trace with hash 1774101781, now seen corresponding path program 132 times [2020-02-10 20:13:30,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:30,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15810367] [2020-02-10 20:13:30,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:30,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:30,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:30,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15810367] [2020-02-10 20:13:30,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:30,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:30,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199701039] [2020-02-10 20:13:30,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:30,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:30,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:30,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:30,878 INFO L87 Difference]: Start difference. First operand 795 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:13:31,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,080 INFO L93 Difference]: Finished difference Result 1419 states and 4967 transitions. [2020-02-10 20:13:31,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:31,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:31,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,084 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:13:31,084 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:13:31,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:31,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:13:31,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 785. [2020-02-10 20:13:31,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:31,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3148 transitions. [2020-02-10 20:13:31,106 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3148 transitions. Word has length 25 [2020-02-10 20:13:31,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,107 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3148 transitions. [2020-02-10 20:13:31,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:31,107 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3148 transitions. [2020-02-10 20:13:31,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:31,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,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, 1, 1, 1] [2020-02-10 20:13:31,108 INFO L427 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1578704807, now seen corresponding path program 133 times [2020-02-10 20:13:31,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244466867] [2020-02-10 20:13:31,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:31,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:31,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244466867] [2020-02-10 20:13:31,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:31,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:31,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955149610] [2020-02-10 20:13:31,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:31,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:31,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:31,511 INFO L87 Difference]: Start difference. First operand 785 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:13:31,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:31,704 INFO L93 Difference]: Finished difference Result 1399 states and 4929 transitions. [2020-02-10 20:13:31,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:31,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:31,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:31,708 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:13:31,708 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:13:31,708 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:31,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:13:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 791. [2020-02-10 20:13:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:31,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3164 transitions. [2020-02-10 20:13:31,730 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3164 transitions. Word has length 25 [2020-02-10 20:13:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:31,730 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3164 transitions. [2020-02-10 20:13:31,731 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3164 transitions. [2020-02-10 20:13:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:31,732 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:31,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, 1, 1, 1] [2020-02-10 20:13:31,732 INFO L427 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:31,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:31,732 INFO L82 PathProgramCache]: Analyzing trace with hash -597950089, now seen corresponding path program 134 times [2020-02-10 20:13:31,732 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:31,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225511876] [2020-02-10 20:13:31,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225511876] [2020-02-10 20:13:32,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:32,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104060608] [2020-02-10 20:13:32,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:32,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:32,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:32,151 INFO L87 Difference]: Start difference. First operand 791 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:13:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:32,348 INFO L93 Difference]: Finished difference Result 1398 states and 4924 transitions. [2020-02-10 20:13:32,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:32,349 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:32,353 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:13:32,353 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:13:32,353 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:32,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:13:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:13:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:32,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3156 transitions. [2020-02-10 20:13:32,375 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3156 transitions. Word has length 25 [2020-02-10 20:13:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:32,375 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3156 transitions. [2020-02-10 20:13:32,375 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:32,376 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3156 transitions. [2020-02-10 20:13:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:32,376 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:32,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, 1, 1, 1] [2020-02-10 20:13:32,377 INFO L427 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:32,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 347329271, now seen corresponding path program 135 times [2020-02-10 20:13:32,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:32,377 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939439338] [2020-02-10 20:13:32,377 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:32,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:32,820 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 27 [2020-02-10 20:13:32,971 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:13:32,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:32,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939439338] [2020-02-10 20:13:32,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:32,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:32,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773386463] [2020-02-10 20:13:32,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:32,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:32,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:32,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:32,983 INFO L87 Difference]: Start difference. First operand 788 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:13:33,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,191 INFO L93 Difference]: Finished difference Result 1404 states and 4937 transitions. [2020-02-10 20:13:33,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:33,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:33,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,196 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:13:33,197 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:13:33,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:33,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:13:33,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 792. [2020-02-10 20:13:33,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3163 transitions. [2020-02-10 20:13:33,251 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3163 transitions. Word has length 25 [2020-02-10 20:13:33,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,252 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3163 transitions. [2020-02-10 20:13:33,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:33,252 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3163 transitions. [2020-02-10 20:13:33,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:33,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,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, 1, 1, 1] [2020-02-10 20:13:33,255 INFO L427 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1338587093, now seen corresponding path program 136 times [2020-02-10 20:13:33,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230393407] [2020-02-10 20:13:33,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:33,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:33,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230393407] [2020-02-10 20:13:33,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:33,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:33,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580156357] [2020-02-10 20:13:33,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:33,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:33,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:33,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:33,659 INFO L87 Difference]: Start difference. First operand 792 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:13:33,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:33,853 INFO L93 Difference]: Finished difference Result 1407 states and 4939 transitions. [2020-02-10 20:13:33,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:33,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:33,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:33,857 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:13:33,857 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:13:33,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:33,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:13:33,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 788. [2020-02-10 20:13:33,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:33,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 20:13:33,880 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 20:13:33,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:33,880 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 20:13:33,880 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 20:13:33,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:33,881 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:33,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, 1, 1, 1] [2020-02-10 20:13:33,881 INFO L427 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:33,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:33,882 INFO L82 PathProgramCache]: Analyzing trace with hash 66271321, now seen corresponding path program 137 times [2020-02-10 20:13:33,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748301966] [2020-02-10 20:13:33,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748301966] [2020-02-10 20:13:34,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:34,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317422141] [2020-02-10 20:13:34,302 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:34,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:34,302 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:13:34,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:34,497 INFO L93 Difference]: Finished difference Result 1401 states and 4927 transitions. [2020-02-10 20:13:34,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:34,498 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:34,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:34,501 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:13:34,502 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:13:34,502 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:13:34,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 20:13:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:34,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3158 transitions. [2020-02-10 20:13:34,525 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3158 transitions. Word has length 25 [2020-02-10 20:13:34,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:34,525 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3158 transitions. [2020-02-10 20:13:34,525 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:34,525 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3158 transitions. [2020-02-10 20:13:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:34,526 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:34,526 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:34,526 INFO L427 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:34,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:34,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1677212279, now seen corresponding path program 138 times [2020-02-10 20:13:34,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:34,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457889577] [2020-02-10 20:13:34,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:34,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:34,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:34,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457889577] [2020-02-10 20:13:34,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:34,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:34,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234075685] [2020-02-10 20:13:34,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:34,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:34,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:34,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:34,935 INFO L87 Difference]: Start difference. First operand 791 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:13:35,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,100 INFO L93 Difference]: Finished difference Result 1405 states and 4932 transitions. [2020-02-10 20:13:35,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:35,101 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:35,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,104 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:13:35,104 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:13:35,104 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:35,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:13:35,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 785. [2020-02-10 20:13:35,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:13:35,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3145 transitions. [2020-02-10 20:13:35,127 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3145 transitions. Word has length 25 [2020-02-10 20:13:35,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,127 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3145 transitions. [2020-02-10 20:13:35,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:35,127 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3145 transitions. [2020-02-10 20:13:35,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:35,129 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,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, 1, 1, 1] [2020-02-10 20:13:35,129 INFO L427 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2060103893, now seen corresponding path program 139 times [2020-02-10 20:13:35,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657862295] [2020-02-10 20:13:35,130 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:35,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:35,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657862295] [2020-02-10 20:13:35,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:35,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:35,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345410130] [2020-02-10 20:13:35,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:35,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:35,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:35,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:35,552 INFO L87 Difference]: Start difference. First operand 785 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:13:35,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:35,739 INFO L93 Difference]: Finished difference Result 1407 states and 4944 transitions. [2020-02-10 20:13:35,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:35,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:35,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:35,743 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:13:35,744 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:13:35,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:35,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:13:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 20:13:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 20:13:35,767 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 20:13:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:35,767 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 20:13:35,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 20:13:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:35,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:35,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, 1, 1, 1] [2020-02-10 20:13:35,768 INFO L427 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:35,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:35,768 INFO L82 PathProgramCache]: Analyzing trace with hash -623922445, now seen corresponding path program 140 times [2020-02-10 20:13:35,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:35,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147090645] [2020-02-10 20:13:35,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:35,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147090645] [2020-02-10 20:13:36,189 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:36,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902955036] [2020-02-10 20:13:36,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:36,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:36,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:36,189 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:13:36,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,377 INFO L93 Difference]: Finished difference Result 1404 states and 4935 transitions. [2020-02-10 20:13:36,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:36,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:36,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,381 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:13:36,381 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:13:36,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:36,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:13:36,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 20:13:36,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:36,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3153 transitions. [2020-02-10 20:13:36,403 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3153 transitions. Word has length 25 [2020-02-10 20:13:36,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:36,404 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3153 transitions. [2020-02-10 20:13:36,404 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:36,404 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3153 transitions. [2020-02-10 20:13:36,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:36,405 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:36,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, 1, 1, 1] [2020-02-10 20:13:36,405 INFO L427 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:36,405 INFO L82 PathProgramCache]: Analyzing trace with hash 459666039, now seen corresponding path program 141 times [2020-02-10 20:13:36,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:36,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059626331] [2020-02-10 20:13:36,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:36,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:36,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:36,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059626331] [2020-02-10 20:13:36,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:36,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:36,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887575467] [2020-02-10 20:13:36,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:36,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:36,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:36,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:36,818 INFO L87 Difference]: Start difference. First operand 788 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:13:36,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:36,994 INFO L93 Difference]: Finished difference Result 1414 states and 4958 transitions. [2020-02-10 20:13:36,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:36,995 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:36,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:36,999 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:13:36,999 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:13:36,999 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:37,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:13:37,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 20:13:37,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:13:37,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:13:37,021 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:13:37,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,021 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:13:37,021 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:13:37,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:37,023 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,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, 1, 1, 1] [2020-02-10 20:13:37,023 INFO L427 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,023 INFO L82 PathProgramCache]: Analyzing trace with hash -613419341, now seen corresponding path program 142 times [2020-02-10 20:13:37,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850068453] [2020-02-10 20:13:37,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:37,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:37,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850068453] [2020-02-10 20:13:37,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:37,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:37,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972077914] [2020-02-10 20:13:37,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:37,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:37,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:37,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:37,471 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:13:37,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:37,668 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 20:13:37,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:37,668 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:37,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:37,671 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:13:37,672 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:13:37,672 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:37,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:13:37,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 788. [2020-02-10 20:13:37,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:13:37,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3150 transitions. [2020-02-10 20:13:37,694 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3150 transitions. Word has length 25 [2020-02-10 20:13:37,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:37,694 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3150 transitions. [2020-02-10 20:13:37,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:37,694 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3150 transitions. [2020-02-10 20:13:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:37,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:37,695 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:37,695 INFO L427 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:37,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:37,695 INFO L82 PathProgramCache]: Analyzing trace with hash 470169143, now seen corresponding path program 143 times [2020-02-10 20:13:37,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:37,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514616865] [2020-02-10 20:13:37,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514616865] [2020-02-10 20:13:38,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:38,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690342752] [2020-02-10 20:13:38,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:38,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:38,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:38,119 INFO L87 Difference]: Start difference. First operand 788 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:13:38,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,314 INFO L93 Difference]: Finished difference Result 1405 states and 4934 transitions. [2020-02-10 20:13:38,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:38,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:38,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,318 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:13:38,319 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:13:38,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:38,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:13:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 791. [2020-02-10 20:13:38,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3155 transitions. [2020-02-10 20:13:38,341 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3155 transitions. Word has length 25 [2020-02-10 20:13:38,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:38,341 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3155 transitions. [2020-02-10 20:13:38,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3155 transitions. [2020-02-10 20:13:38,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:38,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:38,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, 1, 1, 1] [2020-02-10 20:13:38,343 INFO L427 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:38,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:38,343 INFO L82 PathProgramCache]: Analyzing trace with hash 2081110101, now seen corresponding path program 144 times [2020-02-10 20:13:38,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:38,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857037668] [2020-02-10 20:13:38,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:38,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:38,768 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857037668] [2020-02-10 20:13:38,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:38,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:38,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454506192] [2020-02-10 20:13:38,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:38,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:38,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:38,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:38,770 INFO L87 Difference]: Start difference. First operand 791 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:13:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:38,978 INFO L93 Difference]: Finished difference Result 1409 states and 4939 transitions. [2020-02-10 20:13:38,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:38,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:38,982 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 20:13:38,982 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:13:38,983 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:39,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:13:39,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 782. [2020-02-10 20:13:39,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:39,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3137 transitions. [2020-02-10 20:13:39,015 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3137 transitions. Word has length 25 [2020-02-10 20:13:39,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,016 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3137 transitions. [2020-02-10 20:13:39,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:39,016 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3137 transitions. [2020-02-10 20:13:39,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:39,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,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, 1, 1, 1] [2020-02-10 20:13:39,018 INFO L427 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1210888627, now seen corresponding path program 145 times [2020-02-10 20:13:39,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113052670] [2020-02-10 20:13:39,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:39,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:39,385 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113052670] [2020-02-10 20:13:39,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:39,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:39,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805756783] [2020-02-10 20:13:39,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:39,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:39,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:39,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:39,386 INFO L87 Difference]: Start difference. First operand 782 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:13:39,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:39,577 INFO L93 Difference]: Finished difference Result 1411 states and 4961 transitions. [2020-02-10 20:13:39,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:39,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:39,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:39,581 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:13:39,581 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:13:39,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:39,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:13:39,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:13:39,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:39,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3173 transitions. [2020-02-10 20:13:39,603 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3173 transitions. Word has length 25 [2020-02-10 20:13:39,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:39,603 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3173 transitions. [2020-02-10 20:13:39,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:39,603 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3173 transitions. [2020-02-10 20:13:39,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:39,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:39,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, 1, 1, 1] [2020-02-10 20:13:39,605 INFO L427 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:39,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:39,605 INFO L82 PathProgramCache]: Analyzing trace with hash -2113827055, now seen corresponding path program 146 times [2020-02-10 20:13:39,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:39,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900496819] [2020-02-10 20:13:39,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:39,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900496819] [2020-02-10 20:13:40,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:40,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035314260] [2020-02-10 20:13:40,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:40,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:40,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:40,020 INFO L87 Difference]: Start difference. First operand 793 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:13:40,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,217 INFO L93 Difference]: Finished difference Result 1413 states and 4961 transitions. [2020-02-10 20:13:40,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:40,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:40,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,221 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:13:40,222 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:13:40,222 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:40,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:13:40,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:13:40,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:13:40,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3163 transitions. [2020-02-10 20:13:40,244 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3163 transitions. Word has length 25 [2020-02-10 20:13:40,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,244 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3163 transitions. [2020-02-10 20:13:40,244 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:40,244 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3163 transitions. [2020-02-10 20:13:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:40,245 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,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, 1, 1, 1] [2020-02-10 20:13:40,246 INFO L427 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1158044591, now seen corresponding path program 147 times [2020-02-10 20:13:40,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779404167] [2020-02-10 20:13:40,246 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:40,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:40,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779404167] [2020-02-10 20:13:40,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:40,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:40,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372411611] [2020-02-10 20:13:40,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:40,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:40,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:40,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:40,646 INFO L87 Difference]: Start difference. First operand 789 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:13:40,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:40,801 INFO L93 Difference]: Finished difference Result 1407 states and 4949 transitions. [2020-02-10 20:13:40,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:40,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:40,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:40,805 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:13:40,806 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:13:40,806 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:40,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:13:40,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 20:13:40,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:40,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3168 transitions. [2020-02-10 20:13:40,829 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3168 transitions. Word has length 25 [2020-02-10 20:13:40,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:40,829 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3168 transitions. [2020-02-10 20:13:40,829 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3168 transitions. [2020-02-10 20:13:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:40,830 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:40,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, 1, 1, 1] [2020-02-10 20:13:40,830 INFO L427 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:40,831 INFO L82 PathProgramCache]: Analyzing trace with hash -177289873, now seen corresponding path program 148 times [2020-02-10 20:13:40,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:40,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523948069] [2020-02-10 20:13:40,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13: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 20:13:41,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523948069] [2020-02-10 20:13:41,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:41,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048021863] [2020-02-10 20:13:41,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:41,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:41,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:41,235 INFO L87 Difference]: Start difference. First operand 792 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:13:41,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:41,439 INFO L93 Difference]: Finished difference Result 1406 states and 4944 transitions. [2020-02-10 20:13:41,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:41,439 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:41,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:41,443 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:13:41,443 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:13:41,444 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:13:41,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 789. [2020-02-10 20:13:41,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:13:41,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3160 transitions. [2020-02-10 20:13:41,466 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3160 transitions. Word has length 25 [2020-02-10 20:13:41,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:41,466 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3160 transitions. [2020-02-10 20:13:41,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:41,466 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3160 transitions. [2020-02-10 20:13:41,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:41,467 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:41,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, 1, 1, 1] [2020-02-10 20:13:41,467 INFO L427 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:41,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:41,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1775201869, now seen corresponding path program 149 times [2020-02-10 20:13:41,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:41,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595241508] [2020-02-10 20:13:41,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:41,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:41,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595241508] [2020-02-10 20:13:41,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:41,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:41,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210188835] [2020-02-10 20:13:41,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:41,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:41,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:41,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:41,879 INFO L87 Difference]: Start difference. First operand 789 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:13:42,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,040 INFO L93 Difference]: Finished difference Result 1411 states and 4954 transitions. [2020-02-10 20:13:42,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:42,040 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:42,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,044 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:13:42,044 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:13:42,045 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:13:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:13:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:13:42,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3165 transitions. [2020-02-10 20:13:42,067 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3165 transitions. Word has length 25 [2020-02-10 20:13:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,067 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3165 transitions. [2020-02-10 20:13:42,067 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3165 transitions. [2020-02-10 20:13:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:42,068 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,068 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:42,068 INFO L427 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -164260911, now seen corresponding path program 150 times [2020-02-10 20:13:42,069 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696564711] [2020-02-10 20:13:42,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:42,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:42,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696564711] [2020-02-10 20:13:42,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:42,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:42,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406293469] [2020-02-10 20:13:42,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:42,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:42,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:42,469 INFO L87 Difference]: Start difference. First operand 792 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:13:42,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:42,642 INFO L93 Difference]: Finished difference Result 1408 states and 4945 transitions. [2020-02-10 20:13:42,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:42,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:42,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:42,646 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:13:42,647 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:13:42,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:42,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:13:42,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 20:13:42,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:13:42,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3152 transitions. [2020-02-10 20:13:42,669 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3152 transitions. Word has length 25 [2020-02-10 20:13:42,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:42,669 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3152 transitions. [2020-02-10 20:13:42,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3152 transitions. [2020-02-10 20:13:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:42,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:42,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, 1, 1, 1] [2020-02-10 20:13:42,671 INFO L427 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:42,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:42,671 INFO L82 PathProgramCache]: Analyzing trace with hash -56568551, now seen corresponding path program 151 times [2020-02-10 20:13:42,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:42,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549708194] [2020-02-10 20:13:42,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:42,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549708194] [2020-02-10 20:13:43,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:43,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965161084] [2020-02-10 20:13:43,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:43,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:43,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:43,057 INFO L87 Difference]: Start difference. First operand 786 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:13:43,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,233 INFO L93 Difference]: Finished difference Result 1425 states and 4992 transitions. [2020-02-10 20:13:43,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:43,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:43,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,237 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:13:43,237 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:13:43,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:13:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:13:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:13:43,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3177 transitions. [2020-02-10 20:13:43,262 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3177 transitions. Word has length 25 [2020-02-10 20:13:43,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,262 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3177 transitions. [2020-02-10 20:13:43,262 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3177 transitions. [2020-02-10 20:13:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:43,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,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, 1, 1, 1] [2020-02-10 20:13:43,264 INFO L427 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash 913683063, now seen corresponding path program 152 times [2020-02-10 20:13:43,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091651046] [2020-02-10 20:13:43,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:43,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:43,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091651046] [2020-02-10 20:13:43,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:43,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:43,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198648368] [2020-02-10 20:13:43,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:43,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:43,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:43,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:43,663 INFO L87 Difference]: Start difference. First operand 795 states and 3177 transitions. Second operand 10 states. [2020-02-10 20:13:43,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:43,811 INFO L93 Difference]: Finished difference Result 1427 states and 4992 transitions. [2020-02-10 20:13:43,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:43,812 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:43,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:43,815 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:13:43,816 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:13:43,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:43,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:13:43,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 20:13:43,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:43,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3166 transitions. [2020-02-10 20:13:43,838 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3166 transitions. Word has length 25 [2020-02-10 20:13:43,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:43,839 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3166 transitions. [2020-02-10 20:13:43,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:43,839 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3166 transitions. [2020-02-10 20:13:43,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:43,840 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:43,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, 1, 1, 1] [2020-02-10 20:13:43,840 INFO L427 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:43,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:43,840 INFO L82 PathProgramCache]: Analyzing trace with hash -942366831, now seen corresponding path program 153 times [2020-02-10 20:13:43,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:43,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556353375] [2020-02-10 20:13:43,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:43,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556353375] [2020-02-10 20:13:44,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:44,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923131279] [2020-02-10 20:13:44,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:44,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:44,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:44,239 INFO L87 Difference]: Start difference. First operand 791 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:13:44,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,401 INFO L93 Difference]: Finished difference Result 1429 states and 4995 transitions. [2020-02-10 20:13:44,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:44,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:44,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,406 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:13:44,406 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:13:44,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:44,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:13:44,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 796. [2020-02-10 20:13:44,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:13:44,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3175 transitions. [2020-02-10 20:13:44,429 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3175 transitions. Word has length 25 [2020-02-10 20:13:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:44,429 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3175 transitions. [2020-02-10 20:13:44,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3175 transitions. [2020-02-10 20:13:44,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:44,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:44,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, 1, 1, 1] [2020-02-10 20:13:44,430 INFO L427 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:44,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:44,430 INFO L82 PathProgramCache]: Analyzing trace with hash 69897199, now seen corresponding path program 154 times [2020-02-10 20:13:44,431 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:44,431 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377918387] [2020-02-10 20:13:44,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:44,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:44,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:44,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377918387] [2020-02-10 20:13:44,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:44,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:44,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862787909] [2020-02-10 20:13:44,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:44,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:44,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:44,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:44,867 INFO L87 Difference]: Start difference. First operand 796 states and 3175 transitions. Second operand 10 states. [2020-02-10 20:13:44,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:44,987 INFO L93 Difference]: Finished difference Result 1434 states and 5000 transitions. [2020-02-10 20:13:44,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:44,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:44,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:44,991 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:13:44,991 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:13:44,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:45,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:13:45,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 20:13:45,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:13:45,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3161 transitions. [2020-02-10 20:13:45,014 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3161 transitions. Word has length 25 [2020-02-10 20:13:45,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,014 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3161 transitions. [2020-02-10 20:13:45,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:45,014 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3161 transitions. [2020-02-10 20:13:45,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:45,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,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, 1, 1, 1] [2020-02-10 20:13:45,015 INFO L427 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,015 INFO L82 PathProgramCache]: Analyzing trace with hash -2065870375, now seen corresponding path program 155 times [2020-02-10 20:13:45,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36970220] [2020-02-10 20:13:45,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36970220] [2020-02-10 20:13:45,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:45,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732866477] [2020-02-10 20:13:45,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:45,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:45,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:45,421 INFO L87 Difference]: Start difference. First operand 791 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:13:45,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:45,556 INFO L93 Difference]: Finished difference Result 1435 states and 5004 transitions. [2020-02-10 20:13:45,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:45,557 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:45,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:45,560 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:13:45,561 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:13:45,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:45,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:13:45,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 798. [2020-02-10 20:13:45,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:13:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3174 transitions. [2020-02-10 20:13:45,583 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3174 transitions. Word has length 25 [2020-02-10 20:13:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:45,584 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3174 transitions. [2020-02-10 20:13:45,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3174 transitions. [2020-02-10 20:13:45,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:45,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:45,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, 1, 1, 1] [2020-02-10 20:13:45,585 INFO L427 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:45,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:45,585 INFO L82 PathProgramCache]: Analyzing trace with hash 82926161, now seen corresponding path program 156 times [2020-02-10 20:13:45,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:45,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751409052] [2020-02-10 20:13:45,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:45,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:45,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:45,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751409052] [2020-02-10 20:13:45,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:45,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:45,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530715286] [2020-02-10 20:13:45,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:45,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:45,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:45,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:45,993 INFO L87 Difference]: Start difference. First operand 798 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:13:46,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,133 INFO L93 Difference]: Finished difference Result 1438 states and 5003 transitions. [2020-02-10 20:13:46,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:46,133 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:46,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,137 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:13:46,137 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:13:46,138 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:46,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:13:46,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 786. [2020-02-10 20:13:46,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:13:46,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3148 transitions. [2020-02-10 20:13:46,160 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3148 transitions. Word has length 25 [2020-02-10 20:13:46,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,160 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3148 transitions. [2020-02-10 20:13:46,160 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:46,160 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3148 transitions. [2020-02-10 20:13:46,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:46,161 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,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, 1, 1, 1] [2020-02-10 20:13:46,162 INFO L427 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1446979801, now seen corresponding path program 157 times [2020-02-10 20:13:46,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360571604] [2020-02-10 20:13:46,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:46,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:46,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360571604] [2020-02-10 20:13:46,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:46,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:46,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676917400] [2020-02-10 20:13:46,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:46,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:46,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:46,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:46,571 INFO L87 Difference]: Start difference. First operand 786 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:13:46,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:46,705 INFO L93 Difference]: Finished difference Result 1413 states and 4957 transitions. [2020-02-10 20:13:46,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:46,706 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:46,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:46,710 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:13:46,710 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:13:46,710 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:46,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:13:46,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 793. [2020-02-10 20:13:46,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:46,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3167 transitions. [2020-02-10 20:13:46,744 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3167 transitions. Word has length 25 [2020-02-10 20:13:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:46,745 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3167 transitions. [2020-02-10 20:13:46,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3167 transitions. [2020-02-10 20:13:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:46,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:46,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, 1, 1, 1] [2020-02-10 20:13:46,746 INFO L427 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:46,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:46,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1867232777, now seen corresponding path program 158 times [2020-02-10 20:13:46,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:46,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609831391] [2020-02-10 20:13:46,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:46,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,173 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 27 [2020-02-10 20:13:47,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609831391] [2020-02-10 20:13:47,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:47,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539230473] [2020-02-10 20:13:47,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:47,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:47,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:47,179 INFO L87 Difference]: Start difference. First operand 793 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:13:47,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,337 INFO L93 Difference]: Finished difference Result 1412 states and 4952 transitions. [2020-02-10 20:13:47,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:47,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:47,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,341 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:13:47,341 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:13:47,341 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:47,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:13:47,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 790. [2020-02-10 20:13:47,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:47,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 20:13:47,363 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 20:13:47,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,363 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 20:13:47,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 20:13:47,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:47,365 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,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, 1, 1, 1] [2020-02-10 20:13:47,365 INFO L427 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1364852557, now seen corresponding path program 159 times [2020-02-10 20:13:47,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493951325] [2020-02-10 20:13:47,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:47,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:47,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493951325] [2020-02-10 20:13:47,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:47,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:47,767 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854449696] [2020-02-10 20:13:47,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:47,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:47,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:47,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:47,768 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:13:47,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:47,905 INFO L93 Difference]: Finished difference Result 1421 states and 4970 transitions. [2020-02-10 20:13:47,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:47,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:47,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:47,909 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:13:47,909 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:13:47,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:47,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:13:47,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 20:13:47,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:13:47,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 20:13:47,933 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 20:13:47,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:47,933 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 20:13:47,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:47,933 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 20:13:47,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:47,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:47,934 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:47,934 INFO L427 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:47,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:47,934 INFO L82 PathProgramCache]: Analyzing trace with hash -352588527, now seen corresponding path program 160 times [2020-02-10 20:13:47,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:47,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485009677] [2020-02-10 20:13:47,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:47,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:48,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485009677] [2020-02-10 20:13:48,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,361 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:48,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981493704] [2020-02-10 20:13:48,361 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:48,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:48,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:48,362 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:13:48,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:48,471 INFO L93 Difference]: Finished difference Result 1426 states and 4975 transitions. [2020-02-10 20:13:48,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:48,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:48,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:48,476 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:13:48,476 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:13:48,476 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:48,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:13:48,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:13:48,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:48,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:13:48,498 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:13:48,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:48,498 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:13:48,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:48,498 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:13:48,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:48,499 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:48,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, 1, 1, 1] [2020-02-10 20:13:48,500 INFO L427 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:48,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:48,500 INFO L82 PathProgramCache]: Analyzing trace with hash -551818919, now seen corresponding path program 161 times [2020-02-10 20:13:48,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:48,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471480973] [2020-02-10 20:13:48,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:48,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:48,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 20:13:48,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471480973] [2020-02-10 20:13:48,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:48,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:48,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311075410] [2020-02-10 20:13:48,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:48,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:48,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:48,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:48,903 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:13:49,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,045 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 20:13:49,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:49,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:49,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,049 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:13:49,049 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:13:49,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:49,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:13:49,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:13:49,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:13:49,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:13:49,073 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:13:49,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,073 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:13:49,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:49,074 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:13:49,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:49,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,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, 1, 1, 1] [2020-02-10 20:13:49,075 INFO L427 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,075 INFO L82 PathProgramCache]: Analyzing trace with hash -13963341, now seen corresponding path program 162 times [2020-02-10 20:13:49,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567657450] [2020-02-10 20:13:49,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13: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 20:13:49,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567657450] [2020-02-10 20:13:49,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:49,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:49,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493620406] [2020-02-10 20:13:49,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:49,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:49,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:49,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:49,494 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:13:49,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:49,634 INFO L93 Difference]: Finished difference Result 1424 states and 4967 transitions. [2020-02-10 20:13:49,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:49,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:49,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:49,638 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:13:49,638 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:13:49,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:49,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:13:49,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 20:13:49,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:13:49,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3144 transitions. [2020-02-10 20:13:49,661 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3144 transitions. Word has length 25 [2020-02-10 20:13:49,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:49,661 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3144 transitions. [2020-02-10 20:13:49,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:49,661 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3144 transitions. [2020-02-10 20:13:49,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:49,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:49,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, 1, 1, 1] [2020-02-10 20:13:49,663 INFO L427 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:49,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:49,663 INFO L82 PathProgramCache]: Analyzing trace with hash 347922065, now seen corresponding path program 163 times [2020-02-10 20:13:49,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:49,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288375763] [2020-02-10 20:13:49,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:49,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288375763] [2020-02-10 20:13:50,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,072 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:50,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699371000] [2020-02-10 20:13:50,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:50,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:50,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:50,072 INFO L87 Difference]: Start difference. First operand 786 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:13:50,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,242 INFO L93 Difference]: Finished difference Result 1421 states and 4971 transitions. [2020-02-10 20:13:50,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:50,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:50,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,248 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:13:50,248 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:13:50,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:13:50,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 793. [2020-02-10 20:13:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:50,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3163 transitions. [2020-02-10 20:13:50,270 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3163 transitions. Word has length 25 [2020-02-10 20:13:50,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,270 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3163 transitions. [2020-02-10 20:13:50,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:50,270 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3163 transitions. [2020-02-10 20:13:50,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:50,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,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, 1, 1, 1] [2020-02-10 20:13:50,271 INFO L427 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,272 INFO L82 PathProgramCache]: Analyzing trace with hash 1958863023, now seen corresponding path program 164 times [2020-02-10 20:13:50,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599353075] [2020-02-10 20:13:50,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:50,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:50,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599353075] [2020-02-10 20:13:50,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:50,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:50,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799136730] [2020-02-10 20:13:50,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:50,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:50,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:50,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:50,671 INFO L87 Difference]: Start difference. First operand 793 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:13:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:50,806 INFO L93 Difference]: Finished difference Result 1418 states and 4962 transitions. [2020-02-10 20:13:50,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:50,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:50,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:50,810 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:13:50,811 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:13:50,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:50,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:13:50,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:13:50,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:50,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:13:50,833 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:13:50,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:50,833 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:13:50,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:50,834 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:13:50,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:50,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:50,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, 1, 1, 1] [2020-02-10 20:13:50,835 INFO L427 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:50,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:50,835 INFO L82 PathProgramCache]: Analyzing trace with hash -158424201, now seen corresponding path program 165 times [2020-02-10 20:13:50,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:50,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673378528] [2020-02-10 20:13:50,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:50,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673378528] [2020-02-10 20:13:51,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:51,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852756206] [2020-02-10 20:13:51,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:51,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:51,230 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:13:51,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,366 INFO L93 Difference]: Finished difference Result 1431 states and 4990 transitions. [2020-02-10 20:13:51,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:51,367 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:51,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,371 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:13:51,371 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:13:51,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:51,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:13:51,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 20:13:51,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:13:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:13:51,394 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:13:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,394 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:13:51,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:13:51,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:51,395 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,395 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,395 INFO L427 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,395 INFO L82 PathProgramCache]: Analyzing trace with hash 1990372335, now seen corresponding path program 166 times [2020-02-10 20:13:51,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838122319] [2020-02-10 20:13:51,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:51,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:51,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838122319] [2020-02-10 20:13:51,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:51,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:51,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610787797] [2020-02-10 20:13:51,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:51,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:51,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:51,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:51,855 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:13:51,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:51,961 INFO L93 Difference]: Finished difference Result 1434 states and 4989 transitions. [2020-02-10 20:13:51,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:51,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:51,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:51,965 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:13:51,965 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:13:51,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:51,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:13:51,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 20:13:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:13:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3151 transitions. [2020-02-10 20:13:51,988 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3151 transitions. Word has length 25 [2020-02-10 20:13:51,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:51,988 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3151 transitions. [2020-02-10 20:13:51,989 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:51,989 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3151 transitions. [2020-02-10 20:13:51,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:51,990 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:51,990 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:51,990 INFO L427 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:51,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:51,990 INFO L82 PathProgramCache]: Analyzing trace with hash -147921097, now seen corresponding path program 167 times [2020-02-10 20:13:51,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:51,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384942458] [2020-02-10 20:13:51,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:51,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384942458] [2020-02-10 20:13:52,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:52,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362548700] [2020-02-10 20:13:52,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:52,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:52,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:52,398 INFO L87 Difference]: Start difference. First operand 790 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:13:52,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:52,534 INFO L93 Difference]: Finished difference Result 1422 states and 4965 transitions. [2020-02-10 20:13:52,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:52,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:52,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:52,538 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:13:52,539 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:13:52,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:13:52,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 20:13:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:13:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 20:13:52,561 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 20:13:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:52,561 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 20:13:52,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:52,562 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 20:13:52,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:52,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:52,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, 1, 1, 1] [2020-02-10 20:13:52,563 INFO L427 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:52,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:52,563 INFO L82 PathProgramCache]: Analyzing trace with hash 389934481, now seen corresponding path program 168 times [2020-02-10 20:13:52,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:52,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488952067] [2020-02-10 20:13:52,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:52,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:52,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488952067] [2020-02-10 20:13:52,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:52,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:52,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953428333] [2020-02-10 20:13:52,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:52,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:52,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:52,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:52,976 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:13:53,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,083 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:13:53,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:53,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:53,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,087 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:13:53,087 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:13:53,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:53,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:13:53,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 782. [2020-02-10 20:13:53,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:13:53,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3133 transitions. [2020-02-10 20:13:53,110 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3133 transitions. Word has length 25 [2020-02-10 20:13:53,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,110 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3133 transitions. [2020-02-10 20:13:53,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:53,110 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3133 transitions. [2020-02-10 20:13:53,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:53,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,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, 1, 1, 1] [2020-02-10 20:13:53,112 INFO L427 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,112 INFO L82 PathProgramCache]: Analyzing trace with hash 576247283, now seen corresponding path program 169 times [2020-02-10 20:13:53,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587435684] [2020-02-10 20:13:53,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:53,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587435684] [2020-02-10 20:13:53,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:53,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:53,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076705744] [2020-02-10 20:13:53,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:53,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:53,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:53,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:53,512 INFO L87 Difference]: Start difference. First operand 782 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:13:53,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:53,659 INFO L93 Difference]: Finished difference Result 1444 states and 5049 transitions. [2020-02-10 20:13:53,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:53,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:53,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:53,663 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:13:53,663 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:13:53,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:13:53,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 797. [2020-02-10 20:13:53,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:13:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3183 transitions. [2020-02-10 20:13:53,686 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3183 transitions. Word has length 25 [2020-02-10 20:13:53,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:53,686 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3183 transitions. [2020-02-10 20:13:53,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:53,686 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3183 transitions. [2020-02-10 20:13:53,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:53,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:53,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:53,688 INFO L427 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:53,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:53,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1546498897, now seen corresponding path program 170 times [2020-02-10 20:13:53,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:53,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553709581] [2020-02-10 20:13:53,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553709581] [2020-02-10 20:13:54,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:54,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486920648] [2020-02-10 20:13:54,080 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:54,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:54,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:54,081 INFO L87 Difference]: Start difference. First operand 797 states and 3183 transitions. Second operand 10 states. [2020-02-10 20:13:54,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,242 INFO L93 Difference]: Finished difference Result 1446 states and 5049 transitions. [2020-02-10 20:13:54,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:54,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,246 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:13:54,246 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:13:54,247 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:54,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:13:54,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 20:13:54,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:54,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3172 transitions. [2020-02-10 20:13:54,269 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3172 transitions. Word has length 25 [2020-02-10 20:13:54,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,270 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3172 transitions. [2020-02-10 20:13:54,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:54,270 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3172 transitions. [2020-02-10 20:13:54,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:54,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,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, 1, 1, 1] [2020-02-10 20:13:54,271 INFO L427 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,271 INFO L82 PathProgramCache]: Analyzing trace with hash 133348143, now seen corresponding path program 171 times [2020-02-10 20:13:54,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622004069] [2020-02-10 20:13:54,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:54,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:54,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622004069] [2020-02-10 20:13:54,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:54,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:54,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537897862] [2020-02-10 20:13:54,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:54,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:54,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:54,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:54,667 INFO L87 Difference]: Start difference. First operand 793 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:13:54,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:54,806 INFO L93 Difference]: Finished difference Result 1445 states and 5047 transitions. [2020-02-10 20:13:54,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:54,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:54,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:54,810 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:13:54,810 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:13:54,810 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:13:54,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 797. [2020-02-10 20:13:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:13:54,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3179 transitions. [2020-02-10 20:13:54,833 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3179 transitions. Word has length 25 [2020-02-10 20:13:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:54,833 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3179 transitions. [2020-02-10 20:13:54,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:54,833 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3179 transitions. [2020-02-10 20:13:54,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:54,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:54,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, 1, 1, 1] [2020-02-10 20:13:54,835 INFO L427 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:54,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:54,835 INFO L82 PathProgramCache]: Analyzing trace with hash 1124605965, now seen corresponding path program 172 times [2020-02-10 20:13:54,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:54,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590140948] [2020-02-10 20:13:54,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:55,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:55,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590140948] [2020-02-10 20:13:55,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:55,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583417789] [2020-02-10 20:13:55,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:55,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:55,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:55,233 INFO L87 Difference]: Start difference. First operand 797 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:13:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,388 INFO L93 Difference]: Finished difference Result 1448 states and 5049 transitions. [2020-02-10 20:13:55,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:55,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:55,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,392 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:13:55,392 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:13:55,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:55,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:13:55,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 20:13:55,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:13:55,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3168 transitions. [2020-02-10 20:13:55,415 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3168 transitions. Word has length 25 [2020-02-10 20:13:55,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,415 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3168 transitions. [2020-02-10 20:13:55,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:55,415 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3168 transitions. [2020-02-10 20:13:55,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:55,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,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, 1, 1, 1] [2020-02-10 20:13:55,417 INFO L427 AbstractCegarLoop]: === Iteration 180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2084246989, now seen corresponding path program 173 times [2020-02-10 20:13:55,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637248880] [2020-02-10 20:13:55,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13: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 20:13:55,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637248880] [2020-02-10 20:13:55,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:55,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:55,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216290954] [2020-02-10 20:13:55,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:55,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:55,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:55,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:55,818 INFO L87 Difference]: Start difference. First operand 793 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:13:55,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:55,952 INFO L93 Difference]: Finished difference Result 1451 states and 5057 transitions. [2020-02-10 20:13:55,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:55,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:55,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:55,956 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:13:55,956 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:13:55,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:55,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:13:55,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 20:13:55,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:13:55,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 20:13:55,981 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 20:13:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:55,981 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 20:13:55,981 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 20:13:55,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:55,982 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:55,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:55,982 INFO L427 AbstractCegarLoop]: === Iteration 181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:55,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:55,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1137634927, now seen corresponding path program 174 times [2020-02-10 20:13:55,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:55,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23013620] [2020-02-10 20:13:55,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:55,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23013620] [2020-02-10 20:13:56,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:56,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152473902] [2020-02-10 20:13:56,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:56,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:56,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:56,391 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:13:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:56,530 INFO L93 Difference]: Finished difference Result 1452 states and 5053 transitions. [2020-02-10 20:13:56,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:56,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:56,534 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:13:56,534 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:13:56,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:56,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:13:56,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 789. [2020-02-10 20:13:56,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:13:56,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3157 transitions. [2020-02-10 20:13:56,557 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3157 transitions. Word has length 25 [2020-02-10 20:13:56,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:56,557 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3157 transitions. [2020-02-10 20:13:56,557 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:56,557 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3157 transitions. [2020-02-10 20:13:56,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:56,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:56,558 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:56,558 INFO L427 AbstractCegarLoop]: === Iteration 182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:56,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -268724169, now seen corresponding path program 175 times [2020-02-10 20:13:56,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:56,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3013653] [2020-02-10 20:13:56,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:56,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:56,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:56,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3013653] [2020-02-10 20:13:56,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:56,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:56,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030886876] [2020-02-10 20:13:56,975 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:56,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:56,976 INFO L87 Difference]: Start difference. First operand 789 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:13:57,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,123 INFO L93 Difference]: Finished difference Result 1449 states and 5055 transitions. [2020-02-10 20:13:57,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:57,124 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:57,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,128 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:13:57,128 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:13:57,129 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:57,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:13:57,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 20:13:57,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:13:57,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3182 transitions. [2020-02-10 20:13:57,153 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3182 transitions. Word has length 25 [2020-02-10 20:13:57,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,153 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3182 transitions. [2020-02-10 20:13:57,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:57,153 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3182 transitions. [2020-02-10 20:13:57,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:57,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,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, 1, 1, 1] [2020-02-10 20:13:57,154 INFO L427 AbstractCegarLoop]: === Iteration 183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,155 INFO L82 PathProgramCache]: Analyzing trace with hash 701527445, now seen corresponding path program 176 times [2020-02-10 20:13:57,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583307481] [2020-02-10 20:13:57,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:57,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:57,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583307481] [2020-02-10 20:13:57,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:57,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:57,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15951429] [2020-02-10 20:13:57,552 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:57,552 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:57,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:57,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:57,553 INFO L87 Difference]: Start difference. First operand 798 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:13:57,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:57,696 INFO L93 Difference]: Finished difference Result 1451 states and 5055 transitions. [2020-02-10 20:13:57,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:57,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:57,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:57,700 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:13:57,700 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:13:57,701 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:57,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:13:57,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 20:13:57,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:13:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3171 transitions. [2020-02-10 20:13:57,723 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3171 transitions. Word has length 25 [2020-02-10 20:13:57,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:57,723 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3171 transitions. [2020-02-10 20:13:57,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:57,723 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3171 transitions. [2020-02-10 20:13:57,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:57,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:57,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:13:57,725 INFO L427 AbstractCegarLoop]: === Iteration 184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:57,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:57,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1154522449, now seen corresponding path program 177 times [2020-02-10 20:13:57,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:57,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378796134] [2020-02-10 20:13:57,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:57,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378796134] [2020-02-10 20:13:58,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:58,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982295557] [2020-02-10 20:13:58,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:58,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:58,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:58,145 INFO L87 Difference]: Start difference. First operand 794 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:13:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,285 INFO L93 Difference]: Finished difference Result 1453 states and 5058 transitions. [2020-02-10 20:13:58,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:58,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,288 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:13:58,289 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:13:58,289 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:58,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:13:58,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 799. [2020-02-10 20:13:58,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:13:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3180 transitions. [2020-02-10 20:13:58,311 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3180 transitions. Word has length 25 [2020-02-10 20:13:58,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,311 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3180 transitions. [2020-02-10 20:13:58,311 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:58,312 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3180 transitions. [2020-02-10 20:13:58,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:58,313 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,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, 1, 1, 1] [2020-02-10 20:13:58,313 INFO L427 AbstractCegarLoop]: === Iteration 185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,314 INFO L82 PathProgramCache]: Analyzing trace with hash -142258419, now seen corresponding path program 178 times [2020-02-10 20:13:58,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702243208] [2020-02-10 20:13:58,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:58,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:58,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702243208] [2020-02-10 20:13:58,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:58,727 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:58,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214555387] [2020-02-10 20:13:58,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:58,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:58,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:58,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:58,728 INFO L87 Difference]: Start difference. First operand 799 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:13:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:58,844 INFO L93 Difference]: Finished difference Result 1458 states and 5063 transitions. [2020-02-10 20:13:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:58,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:58,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:58,848 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:13:58,848 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:13:58,848 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:13:58,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 794. [2020-02-10 20:13:58,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:13:58,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3166 transitions. [2020-02-10 20:13:58,870 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3166 transitions. Word has length 25 [2020-02-10 20:13:58,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:58,870 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3166 transitions. [2020-02-10 20:13:58,870 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3166 transitions. [2020-02-10 20:13:58,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:58,871 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:58,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, 1, 1, 1] [2020-02-10 20:13:58,872 INFO L427 AbstractCegarLoop]: === Iteration 186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:58,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:58,872 INFO L82 PathProgramCache]: Analyzing trace with hash 2016941303, now seen corresponding path program 179 times [2020-02-10 20:13:58,872 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:58,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694526542] [2020-02-10 20:13:58,872 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:58,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:13:59,280 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694526542] [2020-02-10 20:13:59,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:59,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998579411] [2020-02-10 20:13:59,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:59,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:59,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:59,281 INFO L87 Difference]: Start difference. First operand 794 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:13:59,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:13:59,461 INFO L93 Difference]: Finished difference Result 1459 states and 5067 transitions. [2020-02-10 20:13:59,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:13:59,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:13:59,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:13:59,465 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:13:59,466 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:13:59,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:13:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:13:59,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 801. [2020-02-10 20:13:59,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:13:59,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3179 transitions. [2020-02-10 20:13:59,489 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3179 transitions. Word has length 25 [2020-02-10 20:13:59,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:13:59,489 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3179 transitions. [2020-02-10 20:13:59,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:13:59,489 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3179 transitions. [2020-02-10 20:13:59,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:13:59,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:13:59,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, 1, 1, 1] [2020-02-10 20:13:59,490 INFO L427 AbstractCegarLoop]: === Iteration 187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:13:59,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:13:59,491 INFO L82 PathProgramCache]: Analyzing trace with hash -129229457, now seen corresponding path program 180 times [2020-02-10 20:13:59,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:13:59,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838001927] [2020-02-10 20:13:59,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:13:59,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:13:59,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 20:13:59,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838001927] [2020-02-10 20:13:59,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:13:59,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:13:59,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105952230] [2020-02-10 20:13:59,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:13:59,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:13:59,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:13:59,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:13:59,900 INFO L87 Difference]: Start difference. First operand 801 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:14:00,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,041 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 20:14:00,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:00,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:00,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,046 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:14:00,046 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:14:00,046 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:00,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:14:00,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 20:14:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:00,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3152 transitions. [2020-02-10 20:14:00,069 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3152 transitions. Word has length 25 [2020-02-10 20:14:00,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,069 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3152 transitions. [2020-02-10 20:14:00,069 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:00,069 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3152 transitions. [2020-02-10 20:14:00,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:00,070 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,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, 1, 1, 1] [2020-02-10 20:14:00,071 INFO L427 AbstractCegarLoop]: === Iteration 188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1556594761, now seen corresponding path program 181 times [2020-02-10 20:14:00,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933261255] [2020-02-10 20:14:00,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:00,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933261255] [2020-02-10 20:14:00,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:00,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:00,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126388548] [2020-02-10 20:14:00,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:00,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:00,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:00,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:00,487 INFO L87 Difference]: Start difference. First operand 789 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:14:00,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:00,626 INFO L93 Difference]: Finished difference Result 1454 states and 5060 transitions. [2020-02-10 20:14:00,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:00,626 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:00,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:00,630 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:14:00,630 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 20:14:00,630 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 20:14:00,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 799. [2020-02-10 20:14:00,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:14:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3179 transitions. [2020-02-10 20:14:00,653 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3179 transitions. Word has length 25 [2020-02-10 20:14:00,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:00,653 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3179 transitions. [2020-02-10 20:14:00,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:00,653 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3179 transitions. [2020-02-10 20:14:00,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:00,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:00,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, 1, 1, 1] [2020-02-10 20:14:00,654 INFO L427 AbstractCegarLoop]: === Iteration 189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:00,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:00,655 INFO L82 PathProgramCache]: Analyzing trace with hash -565336939, now seen corresponding path program 182 times [2020-02-10 20:14:00,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:00,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793974510] [2020-02-10 20:14:00,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:00,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793974510] [2020-02-10 20:14:01,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:01,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173837646] [2020-02-10 20:14:01,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:01,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:01,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:01,064 INFO L87 Difference]: Start difference. First operand 799 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:14:01,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,208 INFO L93 Difference]: Finished difference Result 1457 states and 5062 transitions. [2020-02-10 20:14:01,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:01,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:01,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,213 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:14:01,213 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:14:01,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:14:01,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 795. [2020-02-10 20:14:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:14:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3168 transitions. [2020-02-10 20:14:01,237 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3168 transitions. Word has length 25 [2020-02-10 20:14:01,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,237 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3168 transitions. [2020-02-10 20:14:01,237 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3168 transitions. [2020-02-10 20:14:01,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:01,238 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,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, 1, 1, 1] [2020-02-10 20:14:01,239 INFO L427 AbstractCegarLoop]: === Iteration 190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1999493901, now seen corresponding path program 183 times [2020-02-10 20:14:01,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800966720] [2020-02-10 20:14:01,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:01,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:01,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800966720] [2020-02-10 20:14:01,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:01,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:01,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471672726] [2020-02-10 20:14:01,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:01,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:01,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:01,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:01,645 INFO L87 Difference]: Start difference. First operand 795 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:14:01,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:01,783 INFO L93 Difference]: Finished difference Result 1457 states and 5061 transitions. [2020-02-10 20:14:01,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:01,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:01,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:01,787 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:14:01,787 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:14:01,788 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:01,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:14:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 800. [2020-02-10 20:14:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:14:01,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3177 transitions. [2020-02-10 20:14:01,810 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3177 transitions. Word has length 25 [2020-02-10 20:14:01,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:01,811 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3177 transitions. [2020-02-10 20:14:01,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:01,811 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3177 transitions. [2020-02-10 20:14:01,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:01,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:01,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, 1, 1, 1] [2020-02-10 20:14:01,812 INFO L427 AbstractCegarLoop]: === Iteration 191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:01,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:01,812 INFO L82 PathProgramCache]: Analyzing trace with hash -987229871, now seen corresponding path program 184 times [2020-02-10 20:14:01,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:01,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583264491] [2020-02-10 20:14:01,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:01,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583264491] [2020-02-10 20:14:02,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:02,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945984327] [2020-02-10 20:14:02,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:02,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:02,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:02,257 INFO L87 Difference]: Start difference. First operand 800 states and 3177 transitions. Second operand 10 states. [2020-02-10 20:14:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,393 INFO L93 Difference]: Finished difference Result 1462 states and 5066 transitions. [2020-02-10 20:14:02,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:02,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,396 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:14:02,397 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:14:02,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:14:02,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 795. [2020-02-10 20:14:02,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:14:02,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3163 transitions. [2020-02-10 20:14:02,422 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3163 transitions. Word has length 25 [2020-02-10 20:14:02,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:02,422 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3163 transitions. [2020-02-10 20:14:02,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:02,422 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3163 transitions. [2020-02-10 20:14:02,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:02,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:02,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, 1, 1, 1] [2020-02-10 20:14:02,423 INFO L427 AbstractCegarLoop]: === Iteration 192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:02,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:02,424 INFO L82 PathProgramCache]: Analyzing trace with hash 750076919, now seen corresponding path program 185 times [2020-02-10 20:14:02,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:02,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353715297] [2020-02-10 20:14:02,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:02,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:02,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353715297] [2020-02-10 20:14:02,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:02,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:02,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871803584] [2020-02-10 20:14:02,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:02,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:02,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:02,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:02,842 INFO L87 Difference]: Start difference. First operand 795 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:14:02,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:02,985 INFO L93 Difference]: Finished difference Result 1467 states and 5078 transitions. [2020-02-10 20:14:02,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:02,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:02,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:02,989 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:14:02,989 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:14:02,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:03,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:14:03,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 20:14:03,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:14:03,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3179 transitions. [2020-02-10 20:14:03,013 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3179 transitions. Word has length 25 [2020-02-10 20:14:03,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,013 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3179 transitions. [2020-02-10 20:14:03,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:03,014 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3179 transitions. [2020-02-10 20:14:03,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:03,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,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, 1, 1, 1] [2020-02-10 20:14:03,016 INFO L427 AbstractCegarLoop]: === Iteration 193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,016 INFO L82 PathProgramCache]: Analyzing trace with hash -323008461, now seen corresponding path program 186 times [2020-02-10 20:14:03,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511844266] [2020-02-10 20:14:03,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:03,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:03,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511844266] [2020-02-10 20:14:03,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:03,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:03,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335732525] [2020-02-10 20:14:03,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:03,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:03,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:03,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:03,443 INFO L87 Difference]: Start difference. First operand 804 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:14:03,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:03,564 INFO L93 Difference]: Finished difference Result 1469 states and 5074 transitions. [2020-02-10 20:14:03,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:03,565 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:03,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:03,569 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:14:03,569 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:14:03,569 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:03,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:14:03,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 789. [2020-02-10 20:14:03,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:03,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 20:14:03,592 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 20:14:03,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:03,592 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 20:14:03,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:03,592 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 20:14:03,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:03,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:03,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, 1, 1, 1] [2020-02-10 20:14:03,593 INFO L427 AbstractCegarLoop]: === Iteration 194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:03,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:03,594 INFO L82 PathProgramCache]: Analyzing trace with hash 38876945, now seen corresponding path program 187 times [2020-02-10 20:14:03,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:03,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113625790] [2020-02-10 20:14:03,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:03,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113625790] [2020-02-10 20:14:04,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:04,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756036838] [2020-02-10 20:14:04,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:04,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:04,017 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:14:04,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,181 INFO L93 Difference]: Finished difference Result 1469 states and 5093 transitions. [2020-02-10 20:14:04,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:04,182 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:04,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,186 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:14:04,186 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:14:04,186 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:04,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:14:04,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 804. [2020-02-10 20:14:04,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:14:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3186 transitions. [2020-02-10 20:14:04,210 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3186 transitions. Word has length 25 [2020-02-10 20:14:04,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,210 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3186 transitions. [2020-02-10 20:14:04,210 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3186 transitions. [2020-02-10 20:14:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:04,212 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,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, 1, 1, 1] [2020-02-10 20:14:04,212 INFO L427 AbstractCegarLoop]: === Iteration 195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1034208435, now seen corresponding path program 188 times [2020-02-10 20:14:04,212 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,212 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093276930] [2020-02-10 20:14:04,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:04,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:04,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093276930] [2020-02-10 20:14:04,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:04,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:04,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521485293] [2020-02-10 20:14:04,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:04,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:04,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:04,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:04,622 INFO L87 Difference]: Start difference. First operand 804 states and 3186 transitions. Second operand 10 states. [2020-02-10 20:14:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:04,802 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 20:14:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:04,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:04,807 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:14:04,807 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:14:04,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:04,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:14:04,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 798. [2020-02-10 20:14:04,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:14:04,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 20:14:04,833 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 20:14:04,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:04,833 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 20:14:04,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:04,833 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 20:14:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:04,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:04,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, 1, 1, 1] [2020-02-10 20:14:04,835 INFO L427 AbstractCegarLoop]: === Iteration 196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:04,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1132968533, now seen corresponding path program 189 times [2020-02-10 20:14:04,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:04,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585292543] [2020-02-10 20:14:04,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585292543] [2020-02-10 20:14:05,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:05,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124888617] [2020-02-10 20:14:05,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:05,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:05,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:05,259 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:14:05,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,402 INFO L93 Difference]: Finished difference Result 1472 states and 5092 transitions. [2020-02-10 20:14:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:05,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:05,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,407 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:14:05,407 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:14:05,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:05,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:14:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 805. [2020-02-10 20:14:05,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:14:05,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3182 transitions. [2020-02-10 20:14:05,430 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3182 transitions. Word has length 25 [2020-02-10 20:14:05,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:05,430 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3182 transitions. [2020-02-10 20:14:05,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:05,430 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3182 transitions. [2020-02-10 20:14:05,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:05,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:05,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, 1, 1, 1] [2020-02-10 20:14:05,432 INFO L427 AbstractCegarLoop]: === Iteration 197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:05,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:05,432 INFO L82 PathProgramCache]: Analyzing trace with hash -1013202227, now seen corresponding path program 190 times [2020-02-10 20:14:05,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:05,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481815665] [2020-02-10 20:14:05,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:05,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:05,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:05,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481815665] [2020-02-10 20:14:05,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:05,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:05,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810878272] [2020-02-10 20:14:05,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:05,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:05,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:05,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:05,861 INFO L87 Difference]: Start difference. First operand 805 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:14:05,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:05,980 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 20:14:05,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:05,980 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:05,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:05,984 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:14:05,984 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:14:05,984 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:05,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:14:06,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 20:14:06,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:14:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3162 transitions. [2020-02-10 20:14:06,006 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3162 transitions. Word has length 25 [2020-02-10 20:14:06,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,007 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3162 transitions. [2020-02-10 20:14:06,007 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:06,007 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3162 transitions. [2020-02-10 20:14:06,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:06,008 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,008 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:06,008 INFO L427 AbstractCegarLoop]: === Iteration 198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1153974741, now seen corresponding path program 191 times [2020-02-10 20:14:06,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545109031] [2020-02-10 20:14:06,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:06,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:06,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545109031] [2020-02-10 20:14:06,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:06,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:06,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176968175] [2020-02-10 20:14:06,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:06,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:06,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:06,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:06,443 INFO L87 Difference]: Start difference. First operand 798 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:14:06,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:06,585 INFO L93 Difference]: Finished difference Result 1476 states and 5093 transitions. [2020-02-10 20:14:06,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:06,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:06,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:06,589 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:14:06,589 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:14:06,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:14:06,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 807. [2020-02-10 20:14:06,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:14:06,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3178 transitions. [2020-02-10 20:14:06,612 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3178 transitions. Word has length 25 [2020-02-10 20:14:06,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:06,612 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3178 transitions. [2020-02-10 20:14:06,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:06,612 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3178 transitions. [2020-02-10 20:14:06,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:06,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:06,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, 1, 1, 1] [2020-02-10 20:14:06,613 INFO L427 AbstractCegarLoop]: === Iteration 199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:06,613 INFO L82 PathProgramCache]: Analyzing trace with hash 80889361, now seen corresponding path program 192 times [2020-02-10 20:14:06,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:06,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570513420] [2020-02-10 20:14:06,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:07,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570513420] [2020-02-10 20:14:07,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:07,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545900803] [2020-02-10 20:14:07,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:07,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:07,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:07,048 INFO L87 Difference]: Start difference. First operand 807 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:14:07,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,166 INFO L93 Difference]: Finished difference Result 1478 states and 5089 transitions. [2020-02-10 20:14:07,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:07,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:07,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,169 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:14:07,169 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:14:07,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:07,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:14:07,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 782. [2020-02-10 20:14:07,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:14:07,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:14:07,192 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:14:07,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,192 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:14:07,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:07,192 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:14:07,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:07,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,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, 1, 1, 1] [2020-02-10 20:14:07,193 INFO L427 AbstractCegarLoop]: === Iteration 200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1867640017, now seen corresponding path program 193 times [2020-02-10 20:14:07,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971423268] [2020-02-10 20:14:07,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:07,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 20:14:07,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971423268] [2020-02-10 20:14:07,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:07,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120689405] [2020-02-10 20:14:07,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:07,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:07,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:07,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:07,634 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:14:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:07,781 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 20:14:07,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:07,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:07,785 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:14:07,785 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:14:07,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:07,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:14:07,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 793. [2020-02-10 20:14:07,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:07,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 20:14:07,808 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 20:14:07,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:07,808 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 20:14:07,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:07,808 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 20:14:07,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:07,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:07,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, 1, 1, 1] [2020-02-10 20:14:07,809 INFO L427 AbstractCegarLoop]: === Iteration 201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:07,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:07,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1446572561, now seen corresponding path program 194 times [2020-02-10 20:14:07,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:07,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182797829] [2020-02-10 20:14:07,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:07,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182797829] [2020-02-10 20:14:08,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:08,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774861121] [2020-02-10 20:14:08,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:08,208 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:08,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:08,208 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:14:08,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,347 INFO L93 Difference]: Finished difference Result 1413 states and 4952 transitions. [2020-02-10 20:14:08,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:08,348 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:08,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,351 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:14:08,352 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:14:08,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:08,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:14:08,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 790. [2020-02-10 20:14:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:08,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3156 transitions. [2020-02-10 20:14:08,374 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3156 transitions. Word has length 25 [2020-02-10 20:14:08,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,374 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3156 transitions. [2020-02-10 20:14:08,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:08,374 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3156 transitions. [2020-02-10 20:14:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:08,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:08,375 INFO L427 AbstractCegarLoop]: === Iteration 202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,376 INFO L82 PathProgramCache]: Analyzing trace with hash -501293201, now seen corresponding path program 195 times [2020-02-10 20:14:08,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163249046] [2020-02-10 20:14:08,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:08,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:08,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163249046] [2020-02-10 20:14:08,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:08,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:08,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090265257] [2020-02-10 20:14:08,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:08,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:08,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:08,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:08,775 INFO L87 Difference]: Start difference. First operand 790 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:14:08,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:08,920 INFO L93 Difference]: Finished difference Result 1419 states and 4965 transitions. [2020-02-10 20:14:08,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:08,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:08,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:08,924 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:14:08,924 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:14:08,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:14:08,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:14:08,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:14:08,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3163 transitions. [2020-02-10 20:14:08,947 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3163 transitions. Word has length 25 [2020-02-10 20:14:08,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:08,947 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3163 transitions. [2020-02-10 20:14:08,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:08,947 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3163 transitions. [2020-02-10 20:14:08,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:08,948 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:08,948 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:08,948 INFO L427 AbstractCegarLoop]: === Iteration 203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:08,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:08,949 INFO L82 PathProgramCache]: Analyzing trace with hash 489964621, now seen corresponding path program 196 times [2020-02-10 20:14:08,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:08,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41276930] [2020-02-10 20:14:08,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41276930] [2020-02-10 20:14:09,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:09,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891272182] [2020-02-10 20:14:09,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:09,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:09,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:09,344 INFO L87 Difference]: Start difference. First operand 794 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:14:09,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:09,512 INFO L93 Difference]: Finished difference Result 1422 states and 4967 transitions. [2020-02-10 20:14:09,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:09,513 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:09,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:09,516 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:14:09,516 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:14:09,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:09,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:14:09,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:14:09,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:09,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 20:14:09,539 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 20:14:09,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:09,539 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 20:14:09,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:09,539 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 20:14:09,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:09,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:09,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, 1, 1, 1] [2020-02-10 20:14:09,540 INFO L427 AbstractCegarLoop]: === Iteration 204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:09,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:09,540 INFO L82 PathProgramCache]: Analyzing trace with hash -782351151, now seen corresponding path program 197 times [2020-02-10 20:14:09,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:09,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206366433] [2020-02-10 20:14:09,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:09,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206366433] [2020-02-10 20:14:09,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:09,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:09,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615305242] [2020-02-10 20:14:09,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:09,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:09,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:09,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:09,943 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:14:10,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,082 INFO L93 Difference]: Finished difference Result 1416 states and 4955 transitions. [2020-02-10 20:14:10,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:10,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:10,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,086 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:14:10,086 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:14:10,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:10,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:14:10,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 793. [2020-02-10 20:14:10,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:10,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3158 transitions. [2020-02-10 20:14:10,109 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3158 transitions. Word has length 25 [2020-02-10 20:14:10,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,109 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3158 transitions. [2020-02-10 20:14:10,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:10,109 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3158 transitions. [2020-02-10 20:14:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:10,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,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, 1, 1, 1] [2020-02-10 20:14:10,110 INFO L427 AbstractCegarLoop]: === Iteration 205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,111 INFO L82 PathProgramCache]: Analyzing trace with hash 828589807, now seen corresponding path program 198 times [2020-02-10 20:14:10,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137534429] [2020-02-10 20:14:10,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:10,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:10,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2137534429] [2020-02-10 20:14:10,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:10,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:10,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431765157] [2020-02-10 20:14:10,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:10,511 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:10,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:10,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:10,512 INFO L87 Difference]: Start difference. First operand 793 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:14:10,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:10,651 INFO L93 Difference]: Finished difference Result 1420 states and 4960 transitions. [2020-02-10 20:14:10,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:10,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:10,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:10,655 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:14:10,656 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:14:10,656 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:10,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:14:10,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 787. [2020-02-10 20:14:10,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 20:14:10,678 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 20:14:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:10,679 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 20:14:10,679 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 20:14:10,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:10,680 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:10,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, 1, 1, 1] [2020-02-10 20:14:10,680 INFO L427 AbstractCegarLoop]: === Iteration 206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:10,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:10,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1022668565, now seen corresponding path program 199 times [2020-02-10 20:14:10,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:10,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418370574] [2020-02-10 20:14:10,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:10,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418370574] [2020-02-10 20:14:11,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:11,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213443508] [2020-02-10 20:14:11,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:11,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:11,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:11,094 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:14:11,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,233 INFO L93 Difference]: Finished difference Result 1419 states and 4964 transitions. [2020-02-10 20:14:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:11,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:11,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,238 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:14:11,238 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:14:11,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:11,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:14:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:14:11,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:14:11,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:14:11,261 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:14:11,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,261 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:14:11,261 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:11,262 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:14:11,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:11,263 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,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, 1, 1, 1] [2020-02-10 20:14:11,263 INFO L427 AbstractCegarLoop]: === Iteration 207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,263 INFO L82 PathProgramCache]: Analyzing trace with hash 2003423283, now seen corresponding path program 200 times [2020-02-10 20:14:11,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242979640] [2020-02-10 20:14:11,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:11,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:11,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242979640] [2020-02-10 20:14:11,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:11,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:11,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190603681] [2020-02-10 20:14:11,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:11,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:11,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:11,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:11,674 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:14:11,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:11,817 INFO L93 Difference]: Finished difference Result 1418 states and 4959 transitions. [2020-02-10 20:14:11,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:11,818 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:11,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:11,821 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:14:11,821 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:14:11,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:14:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 791. [2020-02-10 20:14:11,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:11,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 20:14:11,843 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 20:14:11,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:11,843 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 20:14:11,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:11,844 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 20:14:11,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:11,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:11,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, 1, 1, 1] [2020-02-10 20:14:11,845 INFO L427 AbstractCegarLoop]: === Iteration 208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:11,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:11,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1789163793, now seen corresponding path program 201 times [2020-02-10 20:14:11,845 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:11,845 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426621428] [2020-02-10 20:14:11,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426621428] [2020-02-10 20:14:12,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:12,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562994724] [2020-02-10 20:14:12,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:12,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:12,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:12,255 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:14:12,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,395 INFO L93 Difference]: Finished difference Result 1427 states and 4977 transitions. [2020-02-10 20:14:12,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:12,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:12,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,399 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:14:12,399 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:14:12,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:12,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:14:12,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 20:14:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:14:12,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3165 transitions. [2020-02-10 20:14:12,422 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3165 transitions. Word has length 25 [2020-02-10 20:14:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:12,422 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3165 transitions. [2020-02-10 20:14:12,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3165 transitions. [2020-02-10 20:14:12,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:12,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:12,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, 1, 1, 1] [2020-02-10 20:14:12,423 INFO L427 AbstractCegarLoop]: === Iteration 209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:12,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:12,423 INFO L82 PathProgramCache]: Analyzing trace with hash -776899763, now seen corresponding path program 202 times [2020-02-10 20:14:12,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:12,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799624384] [2020-02-10 20:14:12,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:12,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:12,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:12,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799624384] [2020-02-10 20:14:12,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:12,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:12,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002848896] [2020-02-10 20:14:12,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:12,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:12,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:12,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:12,842 INFO L87 Difference]: Start difference. First operand 796 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:14:12,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:12,986 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 20:14:12,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:12,987 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:12,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:12,990 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:14:12,990 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:14:12,991 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:13,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:14:13,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 791. [2020-02-10 20:14:13,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:13,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3152 transitions. [2020-02-10 20:14:13,012 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3152 transitions. Word has length 25 [2020-02-10 20:14:13,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,013 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3152 transitions. [2020-02-10 20:14:13,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:13,013 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3152 transitions. [2020-02-10 20:14:13,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:13,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,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, 1, 1, 1] [2020-02-10 20:14:13,014 INFO L427 AbstractCegarLoop]: === Iteration 210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -976130155, now seen corresponding path program 203 times [2020-02-10 20:14:13,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016848696] [2020-02-10 20:14:13,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:13,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:13,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016848696] [2020-02-10 20:14:13,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:13,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:13,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362329110] [2020-02-10 20:14:13,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:13,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:13,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:13,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:13,423 INFO L87 Difference]: Start difference. First operand 791 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:14:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:13,592 INFO L93 Difference]: Finished difference Result 1424 states and 4966 transitions. [2020-02-10 20:14:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:13,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:13,597 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:14:13,597 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:14:13,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:14:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:14:13,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:14:13,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3159 transitions. [2020-02-10 20:14:13,627 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3159 transitions. Word has length 25 [2020-02-10 20:14:13,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:13,627 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3159 transitions. [2020-02-10 20:14:13,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:13,628 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3159 transitions. [2020-02-10 20:14:13,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:13,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:13,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, 1, 1, 1] [2020-02-10 20:14:13,629 INFO L427 AbstractCegarLoop]: === Iteration 211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:13,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:13,629 INFO L82 PathProgramCache]: Analyzing trace with hash -438274577, now seen corresponding path program 204 times [2020-02-10 20:14:13,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:13,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361997034] [2020-02-10 20:14:13,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361997034] [2020-02-10 20:14:14,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:14,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957324526] [2020-02-10 20:14:14,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:14,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:14,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:14,040 INFO L87 Difference]: Start difference. First operand 795 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:14:14,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,163 INFO L93 Difference]: Finished difference Result 1430 states and 4974 transitions. [2020-02-10 20:14:14,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:14,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:14,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,166 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:14:14,167 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:14:14,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:14,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:14:14,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 787. [2020-02-10 20:14:14,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:14,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:14:14,189 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:14:14,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,189 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:14:14,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:14,189 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:14:14,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:14,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,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, 1, 1, 1] [2020-02-10 20:14:14,190 INFO L427 AbstractCegarLoop]: === Iteration 212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1768750379, now seen corresponding path program 205 times [2020-02-10 20:14:14,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29009901] [2020-02-10 20:14:14,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:14,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:14,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29009901] [2020-02-10 20:14:14,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:14,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:14,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071280843] [2020-02-10 20:14:14,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:14,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:14,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:14,624 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:14:14,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:14,763 INFO L93 Difference]: Finished difference Result 1436 states and 5001 transitions. [2020-02-10 20:14:14,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:14,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:14,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:14,768 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:14:14,768 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:14:14,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:14:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 797. [2020-02-10 20:14:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:14:14,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:14:14,791 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:14:14,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:14,792 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:14:14,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:14,792 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:14:14,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:14,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:14,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, 1, 1, 1] [2020-02-10 20:14:14,793 INFO L427 AbstractCegarLoop]: === Iteration 213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:14,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:14,793 INFO L82 PathProgramCache]: Analyzing trace with hash -777492557, now seen corresponding path program 206 times [2020-02-10 20:14:14,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:14,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014231077] [2020-02-10 20:14:14,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:14,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014231077] [2020-02-10 20:14:15,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:15,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233298458] [2020-02-10 20:14:15,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:15,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:15,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:15,207 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:14:15,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,350 INFO L93 Difference]: Finished difference Result 1439 states and 5003 transitions. [2020-02-10 20:14:15,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:15,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:15,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,355 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:14:15,355 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:14:15,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:14:15,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 793. [2020-02-10 20:14:15,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:15,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:14:15,381 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:14:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,382 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:14:15,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:15,382 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:14:15,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:15,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,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, 1, 1, 1] [2020-02-10 20:14:15,383 INFO L427 AbstractCegarLoop]: === Iteration 214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,383 INFO L82 PathProgramCache]: Analyzing trace with hash 2083317777, now seen corresponding path program 207 times [2020-02-10 20:14:15,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094312354] [2020-02-10 20:14:15,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:15,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094312354] [2020-02-10 20:14:15,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:15,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:15,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093330387] [2020-02-10 20:14:15,794 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:15,794 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:15,795 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:14:15,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:15,938 INFO L93 Difference]: Finished difference Result 1439 states and 5002 transitions. [2020-02-10 20:14:15,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:15,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:15,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:15,942 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:14:15,942 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:14:15,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:15,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:14:15,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 20:14:15,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:14:15,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 20:14:15,965 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 20:14:15,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:15,965 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 20:14:15,965 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:15,965 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 20:14:15,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:15,966 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:15,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:15,967 INFO L427 AbstractCegarLoop]: === Iteration 215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:15,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:15,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1199385489, now seen corresponding path program 208 times [2020-02-10 20:14:15,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:15,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716762682] [2020-02-10 20:14:15,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:15,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716762682] [2020-02-10 20:14:16,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:16,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65920235] [2020-02-10 20:14:16,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:16,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:16,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:16,382 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:14:16,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:16,533 INFO L93 Difference]: Finished difference Result 1444 states and 5007 transitions. [2020-02-10 20:14:16,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:16,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:16,537 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:14:16,537 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:14:16,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:16,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:14:16,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 793. [2020-02-10 20:14:16,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:16,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:14:16,560 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:14:16,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:16,561 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:14:16,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:16,561 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:14:16,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:16,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:16,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, 1, 1, 1] [2020-02-10 20:14:16,562 INFO L427 AbstractCegarLoop]: === Iteration 216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:16,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:16,562 INFO L82 PathProgramCache]: Analyzing trace with hash 537921301, now seen corresponding path program 209 times [2020-02-10 20:14:16,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:16,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881575866] [2020-02-10 20:14:16,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:16,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:16,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:16,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881575866] [2020-02-10 20:14:16,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:16,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:16,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293194521] [2020-02-10 20:14:16,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:16,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:16,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:16,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:16,974 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:14:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,125 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 20:14:17,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:17,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,129 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:14:17,129 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:14:17,130 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:14:17,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 20:14:17,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:14:17,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3168 transitions. [2020-02-10 20:14:17,152 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3168 transitions. Word has length 25 [2020-02-10 20:14:17,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,152 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3168 transitions. [2020-02-10 20:14:17,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:17,152 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3168 transitions. [2020-02-10 20:14:17,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:17,153 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,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, 1, 1, 1] [2020-02-10 20:14:17,153 INFO L427 AbstractCegarLoop]: === Iteration 217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,154 INFO L82 PathProgramCache]: Analyzing trace with hash -535164079, now seen corresponding path program 210 times [2020-02-10 20:14:17,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069484582] [2020-02-10 20:14:17,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:17,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 20:14:17,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069484582] [2020-02-10 20:14:17,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:17,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:17,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986963099] [2020-02-10 20:14:17,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:17,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:17,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:17,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:17,584 INFO L87 Difference]: Start difference. First operand 802 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:14:17,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:17,703 INFO L93 Difference]: Finished difference Result 1451 states and 5015 transitions. [2020-02-10 20:14:17,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:17,708 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:17,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:17,711 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:14:17,711 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:14:17,712 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:17,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:14:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 787. [2020-02-10 20:14:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:17,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3136 transitions. [2020-02-10 20:14:17,745 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3136 transitions. Word has length 25 [2020-02-10 20:14:17,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:17,745 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3136 transitions. [2020-02-10 20:14:17,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:17,745 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3136 transitions. [2020-02-10 20:14:17,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:17,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:17,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, 1, 1, 1] [2020-02-10 20:14:17,747 INFO L427 AbstractCegarLoop]: === Iteration 218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:17,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:17,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1340772783, now seen corresponding path program 211 times [2020-02-10 20:14:17,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:17,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932381384] [2020-02-10 20:14:17,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:17,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932381384] [2020-02-10 20:14:18,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:18,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150991857] [2020-02-10 20:14:18,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:18,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:18,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:18,165 INFO L87 Difference]: Start difference. First operand 787 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:14:18,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,305 INFO L93 Difference]: Finished difference Result 1429 states and 4977 transitions. [2020-02-10 20:14:18,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:18,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:18,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,309 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:14:18,309 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:14:18,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:18,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:14:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 795. [2020-02-10 20:14:18,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:14:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 20:14:18,332 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 20:14:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,332 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 20:14:18,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 20:14:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:18,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,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, 1, 1, 1] [2020-02-10 20:14:18,333 INFO L427 AbstractCegarLoop]: === Iteration 219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1343253555, now seen corresponding path program 212 times [2020-02-10 20:14:18,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379484580] [2020-02-10 20:14:18,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:18,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:18,747 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379484580] [2020-02-10 20:14:18,747 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:18,747 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:18,747 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182084859] [2020-02-10 20:14:18,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:18,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:18,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:18,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:18,748 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:14:18,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:18,913 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 20:14:18,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:18,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:18,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:18,918 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:14:18,918 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:14:18,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:14:18,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 792. [2020-02-10 20:14:18,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:18,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:14:18,945 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:18,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:18,945 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:14:18,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:18,945 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:14:18,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:18,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:18,946 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:18,946 INFO L427 AbstractCegarLoop]: === Iteration 220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:18,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:18,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1860102925, now seen corresponding path program 213 times [2020-02-10 20:14:18,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:18,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792932654] [2020-02-10 20:14:18,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:18,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,376 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792932654] [2020-02-10 20:14:19,376 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,376 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:19,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252235518] [2020-02-10 20:14:19,377 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:19,377 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:19,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:19,377 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:14:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:19,521 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 20:14:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:19,522 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:19,525 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:14:19,525 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:14:19,526 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:19,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:14:19,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 796. [2020-02-10 20:14:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:14:19,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 20:14:19,548 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 20:14:19,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:19,548 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 20:14:19,548 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:19,548 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 20:14:19,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:19,549 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:19,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, 1, 1, 1] [2020-02-10 20:14:19,550 INFO L427 AbstractCegarLoop]: === Iteration 221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:19,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:19,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1322247347, now seen corresponding path program 214 times [2020-02-10 20:14:19,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:19,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405822222] [2020-02-10 20:14:19,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:19,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405822222] [2020-02-10 20:14:19,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:19,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:19,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549507297] [2020-02-10 20:14:19,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:19,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:19,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:19,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:19,963 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:14:20,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,111 INFO L93 Difference]: Finished difference Result 1438 states and 4987 transitions. [2020-02-10 20:14:20,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:20,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:20,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,115 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:14:20,115 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:14:20,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:20,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:14:20,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 792. [2020-02-10 20:14:20,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:20,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:14:20,138 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:14:20,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,139 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:14:20,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:20,139 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:14:20,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:20,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,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, 1, 1, 1] [2020-02-10 20:14:20,140 INFO L427 AbstractCegarLoop]: === Iteration 222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1849599821, now seen corresponding path program 215 times [2020-02-10 20:14:20,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756092596] [2020-02-10 20:14:20,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:20,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756092596] [2020-02-10 20:14:20,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:20,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:20,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944476981] [2020-02-10 20:14:20,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:20,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:20,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:20,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:20,566 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:14:20,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:20,705 INFO L93 Difference]: Finished difference Result 1445 states and 5004 transitions. [2020-02-10 20:14:20,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:20,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:20,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:20,709 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:14:20,709 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:14:20,709 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:14:20,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 801. [2020-02-10 20:14:20,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:14:20,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3161 transitions. [2020-02-10 20:14:20,731 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3161 transitions. Word has length 25 [2020-02-10 20:14:20,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:20,732 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3161 transitions. [2020-02-10 20:14:20,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:20,732 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3161 transitions. [2020-02-10 20:14:20,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:20,733 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:20,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, 1, 1, 1] [2020-02-10 20:14:20,733 INFO L427 AbstractCegarLoop]: === Iteration 223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:20,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:20,733 INFO L82 PathProgramCache]: Analyzing trace with hash 1372282095, now seen corresponding path program 216 times [2020-02-10 20:14:20,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:20,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685970506] [2020-02-10 20:14:20,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:20,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685970506] [2020-02-10 20:14:21,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:21,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023482863] [2020-02-10 20:14:21,145 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:21,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:21,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:21,146 INFO L87 Difference]: Start difference. First operand 801 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:14:21,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,265 INFO L93 Difference]: Finished difference Result 1447 states and 5000 transitions. [2020-02-10 20:14:21,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:21,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:21,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,269 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:14:21,269 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:14:21,269 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:21,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:14:21,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 782. [2020-02-10 20:14:21,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:14:21,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3122 transitions. [2020-02-10 20:14:21,291 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3122 transitions. Word has length 25 [2020-02-10 20:14:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,292 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3122 transitions. [2020-02-10 20:14:21,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:21,292 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3122 transitions. [2020-02-10 20:14:21,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:21,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,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, 1, 1, 1] [2020-02-10 20:14:21,293 INFO L427 AbstractCegarLoop]: === Iteration 224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,293 INFO L82 PathProgramCache]: Analyzing trace with hash -842530889, now seen corresponding path program 217 times [2020-02-10 20:14:21,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102461620] [2020-02-10 20:14:21,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:21,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:21,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102461620] [2020-02-10 20:14:21,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:21,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:21,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239481364] [2020-02-10 20:14:21,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:21,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:21,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:21,710 INFO L87 Difference]: Start difference. First operand 782 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:14:21,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:21,857 INFO L93 Difference]: Finished difference Result 1432 states and 4997 transitions. [2020-02-10 20:14:21,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:21,857 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:21,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:21,861 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:14:21,861 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:14:21,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:21,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:14:21,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 20:14:21,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:14:21,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3161 transitions. [2020-02-10 20:14:21,885 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3161 transitions. Word has length 25 [2020-02-10 20:14:21,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:21,885 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3161 transitions. [2020-02-10 20:14:21,885 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:21,885 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3161 transitions. [2020-02-10 20:14:21,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:21,886 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:21,886 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:21,886 INFO L427 AbstractCegarLoop]: === Iteration 225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:21,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:21,886 INFO L82 PathProgramCache]: Analyzing trace with hash 768410069, now seen corresponding path program 218 times [2020-02-10 20:14:21,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:21,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848442341] [2020-02-10 20:14:21,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848442341] [2020-02-10 20:14:22,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:22,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637917680] [2020-02-10 20:14:22,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:22,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:22,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:22,282 INFO L87 Difference]: Start difference. First operand 794 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:14:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:22,427 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:14:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:22,428 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:22,432 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:14:22,432 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:14:22,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:22,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:14:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 20:14:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:22,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3153 transitions. [2020-02-10 20:14:22,455 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3153 transitions. Word has length 25 [2020-02-10 20:14:22,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:22,455 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3153 transitions. [2020-02-10 20:14:22,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:22,455 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3153 transitions. [2020-02-10 20:14:22,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:22,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:22,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, 1, 1, 1] [2020-02-10 20:14:22,457 INFO L427 AbstractCegarLoop]: === Iteration 226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:22,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:22,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1851998553, now seen corresponding path program 219 times [2020-02-10 20:14:22,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:22,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555205077] [2020-02-10 20:14:22,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:22,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:22,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:22,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555205077] [2020-02-10 20:14:22,858 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:22,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:22,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474544435] [2020-02-10 20:14:22,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:22,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:22,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:22,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:22,858 INFO L87 Difference]: Start difference. First operand 791 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:14:23,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,009 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 20:14:23,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:23,010 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:23,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,013 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:14:23,013 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:14:23,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:23,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:14:23,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 20:14:23,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:14:23,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3164 transitions. [2020-02-10 20:14:23,037 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3164 transitions. Word has length 25 [2020-02-10 20:14:23,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,037 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3164 transitions. [2020-02-10 20:14:23,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:23,037 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3164 transitions. [2020-02-10 20:14:23,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:23,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,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, 1, 1, 1] [2020-02-10 20:14:23,038 INFO L427 AbstractCegarLoop]: === Iteration 227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,039 INFO L82 PathProgramCache]: Analyzing trace with hash 778913173, now seen corresponding path program 220 times [2020-02-10 20:14:23,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470154360] [2020-02-10 20:14:23,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:23,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:23,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470154360] [2020-02-10 20:14:23,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:23,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:23,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365322678] [2020-02-10 20:14:23,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:23,446 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:23,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:23,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:23,447 INFO L87 Difference]: Start difference. First operand 797 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:14:23,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:23,597 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 20:14:23,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:23,598 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:23,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:23,602 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:14:23,602 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:14:23,602 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:23,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:14:23,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 20:14:23,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:23,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:14:23,625 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:14:23,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:23,625 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:14:23,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:23,625 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:14:23,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:23,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:23,626 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:23,626 INFO L427 AbstractCegarLoop]: === Iteration 228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:23,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:23,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1862501657, now seen corresponding path program 221 times [2020-02-10 20:14:23,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:23,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690115997] [2020-02-10 20:14:23,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690115997] [2020-02-10 20:14:24,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:24,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281860916] [2020-02-10 20:14:24,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:24,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:24,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:24,030 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:14:24,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,194 INFO L93 Difference]: Finished difference Result 1430 states and 4987 transitions. [2020-02-10 20:14:24,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:24,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:24,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,198 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:14:24,199 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:14:24,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:14:24,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 20:14:24,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:14:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 20:14:24,223 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 20:14:24,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,224 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 20:14:24,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:24,224 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 20:14:24,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:24,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,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, 1, 1, 1] [2020-02-10 20:14:24,225 INFO L427 AbstractCegarLoop]: === Iteration 229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,225 INFO L82 PathProgramCache]: Analyzing trace with hash -821524681, now seen corresponding path program 222 times [2020-02-10 20:14:24,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990076012] [2020-02-10 20:14:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:24,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:24,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990076012] [2020-02-10 20:14:24,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:24,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:24,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697694948] [2020-02-10 20:14:24,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:24,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:24,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:24,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:24,640 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:14:24,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:24,785 INFO L93 Difference]: Finished difference Result 1434 states and 4992 transitions. [2020-02-10 20:14:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:24,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:24,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:24,789 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:14:24,789 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:14:24,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:14:24,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 788. [2020-02-10 20:14:24,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:14:24,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:14:24,814 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:14:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:24,814 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:14:24,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:24,814 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:14:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:24,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:24,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, 1, 1, 1] [2020-02-10 20:14:24,815 INFO L427 AbstractCegarLoop]: === Iteration 230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:24,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:24,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1285430029, now seen corresponding path program 223 times [2020-02-10 20:14:24,815 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:24,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132267371] [2020-02-10 20:14:24,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132267371] [2020-02-10 20:14:25,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,234 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:25,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994246702] [2020-02-10 20:14:25,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:25,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:25,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:25,234 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:14:25,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,381 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 20:14:25,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:25,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:25,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,385 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:14:25,385 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:14:25,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:25,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:14:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 20:14:25,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:14:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 20:14:25,409 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 20:14:25,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,410 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 20:14:25,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 20:14:25,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:25,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,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, 1, 1, 1] [2020-02-10 20:14:25,411 INFO L427 AbstractCegarLoop]: === Iteration 231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,411 INFO L82 PathProgramCache]: Analyzing trace with hash 325510929, now seen corresponding path program 224 times [2020-02-10 20:14:25,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855676886] [2020-02-10 20:14:25,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:25,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:25,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855676886] [2020-02-10 20:14:25,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:25,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:25,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987919477] [2020-02-10 20:14:25,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:25,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:25,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:25,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:25,816 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:14:25,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:25,970 INFO L93 Difference]: Finished difference Result 1434 states and 4995 transitions. [2020-02-10 20:14:25,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:25,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:25,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:25,973 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:14:25,974 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:14:25,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:25,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:14:25,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 20:14:25,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 20:14:25,996 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 20:14:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:25,996 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 20:14:25,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:25,996 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 20:14:25,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:25,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:25,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, 1, 1, 1] [2020-02-10 20:14:25,997 INFO L427 AbstractCegarLoop]: === Iteration 232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:25,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:25,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1791776295, now seen corresponding path program 225 times [2020-02-10 20:14:25,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:25,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102930370] [2020-02-10 20:14:25,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:25,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102930370] [2020-02-10 20:14:26,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:26,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137472377] [2020-02-10 20:14:26,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:26,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:26,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:26,403 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:14:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:26,552 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 20:14:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:26,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:26,557 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:14:26,557 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:14:26,557 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:26,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:14:26,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 799. [2020-02-10 20:14:26,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:14:26,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3166 transitions. [2020-02-10 20:14:26,581 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3166 transitions. Word has length 25 [2020-02-10 20:14:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:26,582 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3166 transitions. [2020-02-10 20:14:26,582 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3166 transitions. [2020-02-10 20:14:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:26,583 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:26,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, 1, 1, 1] [2020-02-10 20:14:26,583 INFO L427 AbstractCegarLoop]: === Iteration 233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:26,583 INFO L82 PathProgramCache]: Analyzing trace with hash 357020241, now seen corresponding path program 226 times [2020-02-10 20:14:26,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:26,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545056235] [2020-02-10 20:14:26,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:26,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:26,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:26,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545056235] [2020-02-10 20:14:26,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:26,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:26,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742672888] [2020-02-10 20:14:26,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:26,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:26,989 INFO L87 Difference]: Start difference. First operand 799 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:14:27,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,113 INFO L93 Difference]: Finished difference Result 1450 states and 5022 transitions. [2020-02-10 20:14:27,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:27,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:27,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,118 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:14:27,118 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:14:27,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:27,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:14:27,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 792. [2020-02-10 20:14:27,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:14:27,141 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:27,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,141 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:14:27,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:27,141 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:14:27,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:27,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,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, 1, 1, 1] [2020-02-10 20:14:27,142 INFO L427 AbstractCegarLoop]: === Iteration 234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1781273191, now seen corresponding path program 227 times [2020-02-10 20:14:27,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732421509] [2020-02-10 20:14:27,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:27,550 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:27,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732421509] [2020-02-10 20:14:27,551 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:27,551 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:27,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642009475] [2020-02-10 20:14:27,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:27,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:27,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:27,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:27,551 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:14:27,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:27,716 INFO L93 Difference]: Finished difference Result 1438 states and 4998 transitions. [2020-02-10 20:14:27,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:27,717 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:27,720 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:14:27,721 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:14:27,721 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:27,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:14:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 796. [2020-02-10 20:14:27,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:14:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3156 transitions. [2020-02-10 20:14:27,745 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3156 transitions. Word has length 25 [2020-02-10 20:14:27,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:27,745 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3156 transitions. [2020-02-10 20:14:27,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3156 transitions. [2020-02-10 20:14:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:27,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:27,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, 1, 1, 1] [2020-02-10 20:14:27,746 INFO L427 AbstractCegarLoop]: === Iteration 235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:27,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:27,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1243417613, now seen corresponding path program 228 times [2020-02-10 20:14:27,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:27,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901462852] [2020-02-10 20:14:27,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901462852] [2020-02-10 20:14:28,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:28,190 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020300524] [2020-02-10 20:14:28,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:28,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:28,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:28,191 INFO L87 Difference]: Start difference. First operand 796 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:14:28,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,310 INFO L93 Difference]: Finished difference Result 1444 states and 5006 transitions. [2020-02-10 20:14:28,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:28,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:28,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,314 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:14:28,314 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:14:28,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:28,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:14:28,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 788. [2020-02-10 20:14:28,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:14:28,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:14:28,336 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:14:28,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,337 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:14:28,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:28,337 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:14:28,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:28,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,338 INFO L427 AbstractCegarLoop]: === Iteration 236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,338 INFO L82 PathProgramCache]: Analyzing trace with hash -959833805, now seen corresponding path program 229 times [2020-02-10 20:14:28,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402483156] [2020-02-10 20:14:28,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:28,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402483156] [2020-02-10 20:14:28,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:28,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:28,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789103895] [2020-02-10 20:14:28,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:28,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:28,752 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:14:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:28,907 INFO L93 Difference]: Finished difference Result 1461 states and 5062 transitions. [2020-02-10 20:14:28,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:28,908 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:28,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:28,912 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:14:28,912 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:14:28,912 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:14:28,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 803. [2020-02-10 20:14:28,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:14:28,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3178 transitions. [2020-02-10 20:14:28,936 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3178 transitions. Word has length 25 [2020-02-10 20:14:28,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:28,936 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3178 transitions. [2020-02-10 20:14:28,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3178 transitions. [2020-02-10 20:14:28,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:28,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:28,937 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:28,937 INFO L427 AbstractCegarLoop]: === Iteration 237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2032919185, now seen corresponding path program 230 times [2020-02-10 20:14:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:28,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684476873] [2020-02-10 20:14:28,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:28,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,350 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684476873] [2020-02-10 20:14:29,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:29,351 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270223871] [2020-02-10 20:14:29,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:29,351 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:29,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:29,351 INFO L87 Difference]: Start difference. First operand 803 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:14:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:29,511 INFO L93 Difference]: Finished difference Result 1462 states and 5058 transitions. [2020-02-10 20:14:29,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:29,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:29,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:29,515 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:14:29,516 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:14:29,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:29,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:14:29,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 797. [2020-02-10 20:14:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:14:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:14:29,538 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:14:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:29,538 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:14:29,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:14:29,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:29,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:29,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, 1, 1, 1] [2020-02-10 20:14:29,540 INFO L427 AbstractCegarLoop]: === Iteration 238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:29,540 INFO L82 PathProgramCache]: Analyzing trace with hash 134257783, now seen corresponding path program 231 times [2020-02-10 20:14:29,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:29,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887726197] [2020-02-10 20:14:29,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:29,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:29,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887726197] [2020-02-10 20:14:29,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:29,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:29,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305559324] [2020-02-10 20:14:29,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:29,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:29,958 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:14:30,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,144 INFO L93 Difference]: Finished difference Result 1464 states and 5061 transitions. [2020-02-10 20:14:30,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:30,144 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:30,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,148 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:14:30,148 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:14:30,148 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:30,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:14:30,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 804. [2020-02-10 20:14:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:14:30,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 20:14:30,171 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 20:14:30,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,171 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 20:14:30,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:30,171 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 20:14:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:30,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:30,172 INFO L427 AbstractCegarLoop]: === Iteration 239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,173 INFO L82 PathProgramCache]: Analyzing trace with hash -2011912977, now seen corresponding path program 232 times [2020-02-10 20:14:30,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286363272] [2020-02-10 20:14:30,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:30,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:30,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286363272] [2020-02-10 20:14:30,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:30,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:30,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435117334] [2020-02-10 20:14:30,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:30,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:30,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:30,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:30,599 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:14:30,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:30,721 INFO L93 Difference]: Finished difference Result 1467 states and 5060 transitions. [2020-02-10 20:14:30,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:30,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:30,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:30,724 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:14:30,724 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:14:30,725 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:30,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:14:30,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 797. [2020-02-10 20:14:30,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:14:30,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 20:14:30,757 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 20:14:30,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:30,757 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 20:14:30,757 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:30,757 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 20:14:30,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:30,758 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:30,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, 1, 1, 1] [2020-02-10 20:14:30,758 INFO L427 AbstractCegarLoop]: === Iteration 240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:30,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:30,758 INFO L82 PathProgramCache]: Analyzing trace with hash 155263991, now seen corresponding path program 233 times [2020-02-10 20:14:30,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:30,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297266737] [2020-02-10 20:14:30,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,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 20:14:31,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297266737] [2020-02-10 20:14:31,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:31,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912126110] [2020-02-10 20:14:31,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:31,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:31,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:31,193 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:14:31,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,342 INFO L93 Difference]: Finished difference Result 1468 states and 5062 transitions. [2020-02-10 20:14:31,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:31,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:31,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,346 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:14:31,346 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:14:31,347 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:31,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:14:31,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 806. [2020-02-10 20:14:31,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:14:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3170 transitions. [2020-02-10 20:14:31,369 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3170 transitions. Word has length 25 [2020-02-10 20:14:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,369 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3170 transitions. [2020-02-10 20:14:31,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:31,369 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3170 transitions. [2020-02-10 20:14:31,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:31,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,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, 1, 1, 1] [2020-02-10 20:14:31,371 INFO L427 AbstractCegarLoop]: === Iteration 241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,371 INFO L82 PathProgramCache]: Analyzing trace with hash -917821389, now seen corresponding path program 234 times [2020-02-10 20:14:31,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114124133] [2020-02-10 20:14:31,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114124133] [2020-02-10 20:14:31,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720318244] [2020-02-10 20:14:31,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:31,799 INFO L87 Difference]: Start difference. First operand 806 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:14:31,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:31,969 INFO L93 Difference]: Finished difference Result 1470 states and 5058 transitions. [2020-02-10 20:14:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:31,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:31,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:31,973 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:14:31,973 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:14:31,973 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:31,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:14:31,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 788. [2020-02-10 20:14:31,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:14:31,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3132 transitions. [2020-02-10 20:14:31,996 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3132 transitions. Word has length 25 [2020-02-10 20:14:31,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:31,996 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3132 transitions. [2020-02-10 20:14:31,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:31,997 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3132 transitions. [2020-02-10 20:14:31,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:31,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:31,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:31,998 INFO L427 AbstractCegarLoop]: === Iteration 242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:31,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:31,998 INFO L82 PathProgramCache]: Analyzing trace with hash 976703377, now seen corresponding path program 235 times [2020-02-10 20:14:31,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:31,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261431764] [2020-02-10 20:14:31,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:31,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:32,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:32,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261431764] [2020-02-10 20:14:32,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:32,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:32,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559724568] [2020-02-10 20:14:32,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:32,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:32,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:32,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:32,407 INFO L87 Difference]: Start difference. First operand 788 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:14:32,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:32,604 INFO L93 Difference]: Finished difference Result 1439 states and 4998 transitions. [2020-02-10 20:14:32,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:32,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:32,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:32,608 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:14:32,608 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:14:32,608 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:14:32,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 796. [2020-02-10 20:14:32,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:14:32,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 20:14:32,631 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 20:14:32,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:32,631 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 20:14:32,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:32,631 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 20:14:32,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:32,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:32,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, 1, 1, 1] [2020-02-10 20:14:32,632 INFO L427 AbstractCegarLoop]: === Iteration 243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:32,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:32,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1707322961, now seen corresponding path program 236 times [2020-02-10 20:14:32,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:32,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057857006] [2020-02-10 20:14:32,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:33,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057857006] [2020-02-10 20:14:33,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:33,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1698615579] [2020-02-10 20:14:33,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:33,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:33,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:33,029 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:14:33,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,177 INFO L93 Difference]: Finished difference Result 1443 states and 5003 transitions. [2020-02-10 20:14:33,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:33,178 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:33,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,181 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:14:33,181 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:14:33,182 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:33,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:14:33,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 20:14:33,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:33,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 20:14:33,204 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 20:14:33,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,204 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 20:14:33,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:33,205 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 20:14:33,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:33,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,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, 1, 1, 1] [2020-02-10 20:14:33,206 INFO L427 AbstractCegarLoop]: === Iteration 244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2070794965, now seen corresponding path program 237 times [2020-02-10 20:14:33,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116862255] [2020-02-10 20:14:33,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:33,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 20:14:33,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116862255] [2020-02-10 20:14:33,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:33,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:33,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92798585] [2020-02-10 20:14:33,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:33,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:33,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:33,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:33,602 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:14:33,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:33,754 INFO L93 Difference]: Finished difference Result 1442 states and 5000 transitions. [2020-02-10 20:14:33,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:33,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:33,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:33,758 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:14:33,758 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:14:33,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:33,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:14:33,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 797. [2020-02-10 20:14:33,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:14:33,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3152 transitions. [2020-02-10 20:14:33,782 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3152 transitions. Word has length 25 [2020-02-10 20:14:33,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:33,782 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3152 transitions. [2020-02-10 20:14:33,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:33,782 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3152 transitions. [2020-02-10 20:14:33,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:33,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:33,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, 1, 1, 1] [2020-02-10 20:14:33,783 INFO L427 AbstractCegarLoop]: === Iteration 245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:33,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1686316753, now seen corresponding path program 238 times [2020-02-10 20:14:33,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:33,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641458217] [2020-02-10 20:14:33,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,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 20:14:34,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641458217] [2020-02-10 20:14:34,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:34,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777417510] [2020-02-10 20:14:34,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:34,214 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:34,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:34,215 INFO L87 Difference]: Start difference. First operand 797 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:14:34,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,353 INFO L93 Difference]: Finished difference Result 1448 states and 5008 transitions. [2020-02-10 20:14:34,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:34,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:34,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,356 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:14:34,357 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:14:34,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:34,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:14:34,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 793. [2020-02-10 20:14:34,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3141 transitions. [2020-02-10 20:14:34,379 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3141 transitions. Word has length 25 [2020-02-10 20:14:34,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,379 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3141 transitions. [2020-02-10 20:14:34,380 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3141 transitions. [2020-02-10 20:14:34,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:34,381 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,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, 1, 1, 1] [2020-02-10 20:14:34,381 INFO L427 AbstractCegarLoop]: === Iteration 246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,381 INFO L82 PathProgramCache]: Analyzing trace with hash 2081298069, now seen corresponding path program 239 times [2020-02-10 20:14:34,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468906767] [2020-02-10 20:14:34,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:34,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:34,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468906767] [2020-02-10 20:14:34,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:34,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:34,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6687549] [2020-02-10 20:14:34,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:34,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:34,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:34,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:34,793 INFO L87 Difference]: Start difference. First operand 793 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:14:34,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:34,937 INFO L93 Difference]: Finished difference Result 1455 states and 5025 transitions. [2020-02-10 20:14:34,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:34,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:34,941 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:14:34,942 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:14:34,942 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:34,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:14:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 802. [2020-02-10 20:14:34,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:14:34,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3157 transitions. [2020-02-10 20:14:34,965 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3157 transitions. Word has length 25 [2020-02-10 20:14:34,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:34,965 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3157 transitions. [2020-02-10 20:14:34,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:34,966 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3157 transitions. [2020-02-10 20:14:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:34,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:34,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:34,967 INFO L427 AbstractCegarLoop]: === Iteration 247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:34,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1008212689, now seen corresponding path program 240 times [2020-02-10 20:14:34,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:34,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826346420] [2020-02-10 20:14:34,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:34,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826346420] [2020-02-10 20:14:35,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:35,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104418888] [2020-02-10 20:14:35,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:35,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:35,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:35,387 INFO L87 Difference]: Start difference. First operand 802 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:14:35,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:35,524 INFO L93 Difference]: Finished difference Result 1457 states and 5021 transitions. [2020-02-10 20:14:35,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:35,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:35,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:35,527 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:14:35,528 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:14:35,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:14:35,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 776. [2020-02-10 20:14:35,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:14:35,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3105 transitions. [2020-02-10 20:14:35,550 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3105 transitions. Word has length 25 [2020-02-10 20:14:35,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:35,550 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3105 transitions. [2020-02-10 20:14:35,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:35,550 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3105 transitions. [2020-02-10 20:14:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:35,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:35,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, 1, 1, 1] [2020-02-10 20:14:35,552 INFO L427 AbstractCegarLoop]: === Iteration 248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash -858812617, now seen corresponding path program 241 times [2020-02-10 20:14:35,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:35,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993546426] [2020-02-10 20:14:35,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:35,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:35,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993546426] [2020-02-10 20:14:35,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:35,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:35,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046820106] [2020-02-10 20:14:35,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:35,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:35,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:35,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:35,959 INFO L87 Difference]: Start difference. First operand 776 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:14:36,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,106 INFO L93 Difference]: Finished difference Result 1381 states and 4884 transitions. [2020-02-10 20:14:36,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:36,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:36,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,111 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:14:36,111 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:14:36,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:36,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:14:36,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 790. [2020-02-10 20:14:36,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:36,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3159 transitions. [2020-02-10 20:14:36,134 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3159 transitions. Word has length 25 [2020-02-10 20:14:36,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,134 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3159 transitions. [2020-02-10 20:14:36,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:36,134 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3159 transitions. [2020-02-10 20:14:36,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:36,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,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, 1, 1, 1] [2020-02-10 20:14:36,135 INFO L427 AbstractCegarLoop]: === Iteration 249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,135 INFO L82 PathProgramCache]: Analyzing trace with hash 111438997, now seen corresponding path program 242 times [2020-02-10 20:14:36,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945233639] [2020-02-10 20:14:36,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:36,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:36,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945233639] [2020-02-10 20:14:36,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:36,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:36,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199498081] [2020-02-10 20:14:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:36,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:36,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:36,540 INFO L87 Difference]: Start difference. First operand 790 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:14:36,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:36,688 INFO L93 Difference]: Finished difference Result 1383 states and 4884 transitions. [2020-02-10 20:14:36,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:36,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:36,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:36,692 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:14:36,692 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:14:36,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:36,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:14:36,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 786. [2020-02-10 20:14:36,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:36,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3149 transitions. [2020-02-10 20:14:36,714 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:36,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:36,715 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3149 transitions. [2020-02-10 20:14:36,715 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:36,715 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3149 transitions. [2020-02-10 20:14:36,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:36,716 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:36,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, 1, 1, 1] [2020-02-10 20:14:36,716 INFO L427 AbstractCegarLoop]: === Iteration 250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:36,716 INFO L82 PathProgramCache]: Analyzing trace with hash 1067221461, now seen corresponding path program 243 times [2020-02-10 20:14:36,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:36,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176111094] [2020-02-10 20:14:36,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176111094] [2020-02-10 20:14:37,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:37,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282128793] [2020-02-10 20:14:37,118 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:37,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:37,118 INFO L87 Difference]: Start difference. First operand 786 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:14:37,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,266 INFO L93 Difference]: Finished difference Result 1377 states and 4872 transitions. [2020-02-10 20:14:37,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:37,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:37,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,270 INFO L225 Difference]: With dead ends: 1377 [2020-02-10 20:14:37,270 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:14:37,270 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:37,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:14:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 20:14:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:14:37,292 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:14:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,293 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:14:37,293 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:14:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:37,294 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:37,294 INFO L427 AbstractCegarLoop]: === Iteration 251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2047976179, now seen corresponding path program 244 times [2020-02-10 20:14:37,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152771420] [2020-02-10 20:14:37,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:37,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152771420] [2020-02-10 20:14:37,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:37,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:37,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973125907] [2020-02-10 20:14:37,694 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:37,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:37,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:37,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:37,695 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:14:37,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:37,848 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 20:14:37,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:37,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:37,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:37,852 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:14:37,852 INFO L226 Difference]: Without dead ends: 1361 [2020-02-10 20:14:37,852 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:37,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2020-02-10 20:14:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 786. [2020-02-10 20:14:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:37,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3146 transitions. [2020-02-10 20:14:37,874 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3146 transitions. Word has length 25 [2020-02-10 20:14:37,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:37,874 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3146 transitions. [2020-02-10 20:14:37,874 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:37,874 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3146 transitions. [2020-02-10 20:14:37,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:37,875 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:37,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, 1, 1, 1] [2020-02-10 20:14:37,876 INFO L427 AbstractCegarLoop]: === Iteration 252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:37,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:37,876 INFO L82 PathProgramCache]: Analyzing trace with hash 450064183, now seen corresponding path program 245 times [2020-02-10 20:14:37,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:37,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867884178] [2020-02-10 20:14:37,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:37,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867884178] [2020-02-10 20:14:38,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:38,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857630167] [2020-02-10 20:14:38,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:38,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:38,276 INFO L87 Difference]: Start difference. First operand 786 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:14:38,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:38,423 INFO L93 Difference]: Finished difference Result 1381 states and 4877 transitions. [2020-02-10 20:14:38,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:38,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:38,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:38,427 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:14:38,427 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 20:14:38,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 20:14:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 789. [2020-02-10 20:14:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:38,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:14:38,449 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:14:38,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:38,449 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:14:38,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:38,449 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:14:38,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:38,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:38,451 INFO L427 AbstractCegarLoop]: === Iteration 253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:38,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:38,451 INFO L82 PathProgramCache]: Analyzing trace with hash 2061005141, now seen corresponding path program 246 times [2020-02-10 20:14:38,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:38,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540924128] [2020-02-10 20:14:38,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:38,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:38,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540924128] [2020-02-10 20:14:38,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:38,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:38,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891596872] [2020-02-10 20:14:38,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:38,857 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:38,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:38,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:38,857 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:14:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,000 INFO L93 Difference]: Finished difference Result 1378 states and 4868 transitions. [2020-02-10 20:14:39,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:39,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,003 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:14:39,003 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:14:39,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:39,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:14:39,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 783. [2020-02-10 20:14:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:14:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3138 transitions. [2020-02-10 20:14:39,025 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3138 transitions. Word has length 25 [2020-02-10 20:14:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,025 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3138 transitions. [2020-02-10 20:14:39,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3138 transitions. [2020-02-10 20:14:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:39,026 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,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, 1, 1, 1] [2020-02-10 20:14:39,027 INFO L427 AbstractCegarLoop]: === Iteration 254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,027 INFO L82 PathProgramCache]: Analyzing trace with hash -1703784069, now seen corresponding path program 247 times [2020-02-10 20:14:39,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759671636] [2020-02-10 20:14:39,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:39,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:39,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759671636] [2020-02-10 20:14:39,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:39,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:39,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845237240] [2020-02-10 20:14:39,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:39,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:39,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:39,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:39,435 INFO L87 Difference]: Start difference. First operand 783 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:14:39,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:39,601 INFO L93 Difference]: Finished difference Result 1387 states and 4898 transitions. [2020-02-10 20:14:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:39,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:39,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:39,605 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:14:39,605 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:14:39,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:14:39,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 791. [2020-02-10 20:14:39,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:39,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 20:14:39,629 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 20:14:39,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:39,629 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 20:14:39,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:39,629 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 20:14:39,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:39,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:39,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, 1, 1, 1] [2020-02-10 20:14:39,630 INFO L427 AbstractCegarLoop]: === Iteration 255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:39,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:39,631 INFO L82 PathProgramCache]: Analyzing trace with hash -733532455, now seen corresponding path program 248 times [2020-02-10 20:14:39,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:39,631 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654670615] [2020-02-10 20:14:39,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:39,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654670615] [2020-02-10 20:14:40,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:40,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135040597] [2020-02-10 20:14:40,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:40,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:40,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:40,050 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:14:40,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,188 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:14:40,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:40,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:40,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,192 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:14:40,192 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:14:40,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:14:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:14:40,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:40,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3149 transitions. [2020-02-10 20:14:40,215 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:40,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,215 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3149 transitions. [2020-02-10 20:14:40,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:40,215 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3149 transitions. [2020-02-10 20:14:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:40,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,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, 1, 1, 1] [2020-02-10 20:14:40,217 INFO L427 AbstractCegarLoop]: === Iteration 256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash -220649131, now seen corresponding path program 249 times [2020-02-10 20:14:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579215215] [2020-02-10 20:14:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:40,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579215215] [2020-02-10 20:14:40,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:40,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:40,625 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922422353] [2020-02-10 20:14:40,625 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:40,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:40,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:40,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:40,626 INFO L87 Difference]: Start difference. First operand 787 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:14:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:40,765 INFO L93 Difference]: Finished difference Result 1386 states and 4892 transitions. [2020-02-10 20:14:40,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:40,767 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:40,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:40,771 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:14:40,771 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:14:40,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:40,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:14:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 791. [2020-02-10 20:14:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:40,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3156 transitions. [2020-02-10 20:14:40,799 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3156 transitions. Word has length 25 [2020-02-10 20:14:40,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:40,799 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3156 transitions. [2020-02-10 20:14:40,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:40,800 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3156 transitions. [2020-02-10 20:14:40,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:40,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:40,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, 1, 1, 1] [2020-02-10 20:14:40,801 INFO L427 AbstractCegarLoop]: === Iteration 257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:40,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:40,801 INFO L82 PathProgramCache]: Analyzing trace with hash 781111795, now seen corresponding path program 250 times [2020-02-10 20:14:40,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:40,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749118491] [2020-02-10 20:14:40,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:41,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749118491] [2020-02-10 20:14:41,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:41,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893342489] [2020-02-10 20:14:41,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:41,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:41,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:41,210 INFO L87 Difference]: Start difference. First operand 791 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:14:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,364 INFO L93 Difference]: Finished difference Result 1387 states and 4890 transitions. [2020-02-10 20:14:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:41,365 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:41,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,369 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:14:41,369 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 20:14:41,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:41,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 20:14:41,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 787. [2020-02-10 20:14:41,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3145 transitions. [2020-02-10 20:14:41,391 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3145 transitions. Word has length 25 [2020-02-10 20:14:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,392 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3145 transitions. [2020-02-10 20:14:41,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3145 transitions. [2020-02-10 20:14:41,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:41,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,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, 1, 1, 1] [2020-02-10 20:14:41,393 INFO L427 AbstractCegarLoop]: === Iteration 258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,393 INFO L82 PathProgramCache]: Analyzing trace with hash 256285179, now seen corresponding path program 251 times [2020-02-10 20:14:41,393 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,393 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180408496] [2020-02-10 20:14:41,393 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:41,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 20:14:41,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180408496] [2020-02-10 20:14:41,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:41,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:41,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115390787] [2020-02-10 20:14:41,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:41,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:41,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:41,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:41,804 INFO L87 Difference]: Start difference. First operand 787 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:14:41,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:41,938 INFO L93 Difference]: Finished difference Result 1391 states and 4899 transitions. [2020-02-10 20:14:41,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:41,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:41,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:41,942 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:14:41,942 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:14:41,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:41,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:14:41,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 792. [2020-02-10 20:14:41,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:41,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 20:14:41,967 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 20:14:41,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:41,967 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 20:14:41,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 20:14:41,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:41,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:41,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:41,968 INFO L427 AbstractCegarLoop]: === Iteration 259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:41,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:41,969 INFO L82 PathProgramCache]: Analyzing trace with hash 794140757, now seen corresponding path program 252 times [2020-02-10 20:14:41,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:41,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143080336] [2020-02-10 20:14:41,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,387 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143080336] [2020-02-10 20:14:42,387 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,387 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:42,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782630005] [2020-02-10 20:14:42,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:42,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:42,388 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:14:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:42,550 INFO L93 Difference]: Finished difference Result 1390 states and 4892 transitions. [2020-02-10 20:14:42,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:42,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:42,555 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:14:42,555 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:14:42,555 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:42,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:14:42,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 783. [2020-02-10 20:14:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:14:42,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3135 transitions. [2020-02-10 20:14:42,577 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3135 transitions. Word has length 25 [2020-02-10 20:14:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:42,577 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3135 transitions. [2020-02-10 20:14:42,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:42,577 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3135 transitions. [2020-02-10 20:14:42,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:42,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:42,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, 1, 1, 1] [2020-02-10 20:14:42,579 INFO L427 AbstractCegarLoop]: === Iteration 260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:42,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:42,579 INFO L82 PathProgramCache]: Analyzing trace with hash -200235717, now seen corresponding path program 253 times [2020-02-10 20:14:42,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:42,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298932012] [2020-02-10 20:14:42,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:42,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:42,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298932012] [2020-02-10 20:14:42,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:42,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:42,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903958276] [2020-02-10 20:14:42,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:42,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:42,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:42,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:42,989 INFO L87 Difference]: Start difference. First operand 783 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:14:43,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,136 INFO L93 Difference]: Finished difference Result 1376 states and 4867 transitions. [2020-02-10 20:14:43,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:43,137 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:43,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,140 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:14:43,141 INFO L226 Difference]: Without dead ends: 1363 [2020-02-10 20:14:43,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:43,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1363 states. [2020-02-10 20:14:43,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1363 to 789. [2020-02-10 20:14:43,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:43,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3151 transitions. [2020-02-10 20:14:43,164 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3151 transitions. Word has length 25 [2020-02-10 20:14:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,164 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3151 transitions. [2020-02-10 20:14:43,164 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3151 transitions. [2020-02-10 20:14:43,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:43,165 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,165 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,165 INFO L427 AbstractCegarLoop]: === Iteration 261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,165 INFO L82 PathProgramCache]: Analyzing trace with hash 780519001, now seen corresponding path program 254 times [2020-02-10 20:14:43,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744347676] [2020-02-10 20:14:43,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:43,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 20:14:43,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744347676] [2020-02-10 20:14:43,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:43,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:43,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844211904] [2020-02-10 20:14:43,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:43,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:43,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:43,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:43,579 INFO L87 Difference]: Start difference. First operand 789 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:14:43,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:43,735 INFO L93 Difference]: Finished difference Result 1375 states and 4862 transitions. [2020-02-10 20:14:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:43,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:43,740 INFO L225 Difference]: With dead ends: 1375 [2020-02-10 20:14:43,740 INFO L226 Difference]: Without dead ends: 1360 [2020-02-10 20:14:43,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:43,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1360 states. [2020-02-10 20:14:43,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1360 to 786. [2020-02-10 20:14:43,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:43,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3143 transitions. [2020-02-10 20:14:43,762 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3143 transitions. Word has length 25 [2020-02-10 20:14:43,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:43,762 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3143 transitions. [2020-02-10 20:14:43,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:43,762 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3143 transitions. [2020-02-10 20:14:43,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:43,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:43,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:43,763 INFO L427 AbstractCegarLoop]: === Iteration 262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:43,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:43,763 INFO L82 PathProgramCache]: Analyzing trace with hash -643134857, now seen corresponding path program 255 times [2020-02-10 20:14:43,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:43,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686914542] [2020-02-10 20:14:43,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686914542] [2020-02-10 20:14:44,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:44,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131872251] [2020-02-10 20:14:44,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:44,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:44,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:44,167 INFO L87 Difference]: Start difference. First operand 786 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:14:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,318 INFO L93 Difference]: Finished difference Result 1379 states and 4871 transitions. [2020-02-10 20:14:44,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:44,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:44,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,322 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:14:44,323 INFO L226 Difference]: Without dead ends: 1366 [2020-02-10 20:14:44,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:44,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2020-02-10 20:14:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 790. [2020-02-10 20:14:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:14:44,345 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:14:44,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,345 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:14:44,345 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:14:44,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:44,346 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,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, 1, 1, 1] [2020-02-10 20:14:44,346 INFO L427 AbstractCegarLoop]: === Iteration 263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,347 INFO L82 PathProgramCache]: Analyzing trace with hash 358626069, now seen corresponding path program 256 times [2020-02-10 20:14:44,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375883991] [2020-02-10 20:14:44,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:44,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:44,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375883991] [2020-02-10 20:14:44,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:44,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:44,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746389673] [2020-02-10 20:14:44,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:44,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:44,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:44,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:44,828 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:14:44,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:44,971 INFO L93 Difference]: Finished difference Result 1380 states and 4869 transitions. [2020-02-10 20:14:44,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:44,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:44,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:44,975 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:14:44,975 INFO L226 Difference]: Without dead ends: 1362 [2020-02-10 20:14:44,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:44,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1362 states. [2020-02-10 20:14:44,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1362 to 786. [2020-02-10 20:14:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:44,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 20:14:44,997 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 20:14:44,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:44,997 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 20:14:44,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:44,997 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 20:14:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:44,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:44,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, 1, 1, 1] [2020-02-10 20:14:44,999 INFO L427 AbstractCegarLoop]: === Iteration 264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:44,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:44,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1770336635, now seen corresponding path program 257 times [2020-02-10 20:14:44,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:44,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336644118] [2020-02-10 20:14:44,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:45,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336644118] [2020-02-10 20:14:45,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:45,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398979757] [2020-02-10 20:14:45,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:45,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:45,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:45,404 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:14:45,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:45,566 INFO L93 Difference]: Finished difference Result 1376 states and 4861 transitions. [2020-02-10 20:14:45,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:45,566 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:45,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:45,570 INFO L225 Difference]: With dead ends: 1376 [2020-02-10 20:14:45,570 INFO L226 Difference]: Without dead ends: 1364 [2020-02-10 20:14:45,570 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:45,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2020-02-10 20:14:45,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 789. [2020-02-10 20:14:45,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:45,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 20:14:45,592 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 20:14:45,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:45,592 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 20:14:45,592 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:45,592 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 20:14:45,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:45,593 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:45,593 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:45,593 INFO L427 AbstractCegarLoop]: === Iteration 265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:45,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:45,594 INFO L82 PathProgramCache]: Analyzing trace with hash 697251255, now seen corresponding path program 258 times [2020-02-10 20:14:45,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:45,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651560312] [2020-02-10 20:14:45,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:45,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 20:14:45,996 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651560312] [2020-02-10 20:14:45,996 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:45,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:45,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947108680] [2020-02-10 20:14:45,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:45,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:45,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:45,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:45,997 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:14:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,146 INFO L93 Difference]: Finished difference Result 1378 states and 4862 transitions. [2020-02-10 20:14:46,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:46,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:46,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,150 INFO L225 Difference]: With dead ends: 1378 [2020-02-10 20:14:46,150 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:14:46,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:46,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:14:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 783. [2020-02-10 20:14:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:14:46,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3132 transitions. [2020-02-10 20:14:46,172 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3132 transitions. Word has length 25 [2020-02-10 20:14:46,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,172 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3132 transitions. [2020-02-10 20:14:46,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:46,173 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3132 transitions. [2020-02-10 20:14:46,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:46,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:46,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, 1, 1, 1] [2020-02-10 20:14:46,174 INFO L427 AbstractCegarLoop]: === Iteration 266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1069639765, now seen corresponding path program 259 times [2020-02-10 20:14:46,174 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,174 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579403890] [2020-02-10 20:14:46,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:46,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:46,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579403890] [2020-02-10 20:14:46,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:46,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:46,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870143797] [2020-02-10 20:14:46,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:46,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:46,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:46,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:46,588 INFO L87 Difference]: Start difference. First operand 783 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:14:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:46,731 INFO L93 Difference]: Finished difference Result 1383 states and 4879 transitions. [2020-02-10 20:14:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:46,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:46,736 INFO L225 Difference]: With dead ends: 1383 [2020-02-10 20:14:46,736 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:14:46,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:46,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:14:46,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 789. [2020-02-10 20:14:46,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:46,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:14:46,758 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:14:46,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:46,758 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:14:46,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:46,758 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:14:46,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:46,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:46,759 INFO L427 AbstractCegarLoop]: === Iteration 267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash -1614386573, now seen corresponding path program 260 times [2020-02-10 20:14:46,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:46,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003479115] [2020-02-10 20:14:46,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003479115] [2020-02-10 20:14:47,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:47,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137986454] [2020-02-10 20:14:47,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:47,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:47,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:47,158 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:14:47,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,310 INFO L93 Difference]: Finished difference Result 1380 states and 4870 transitions. [2020-02-10 20:14:47,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:47,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:47,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,314 INFO L225 Difference]: With dead ends: 1380 [2020-02-10 20:14:47,314 INFO L226 Difference]: Without dead ends: 1365 [2020-02-10 20:14:47,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:47,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2020-02-10 20:14:47,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 786. [2020-02-10 20:14:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3140 transitions. [2020-02-10 20:14:47,336 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3140 transitions. Word has length 25 [2020-02-10 20:14:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,337 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3140 transitions. [2020-02-10 20:14:47,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:47,337 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3140 transitions. [2020-02-10 20:14:47,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:47,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:47,338 INFO L427 AbstractCegarLoop]: === Iteration 268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2131235943, now seen corresponding path program 261 times [2020-02-10 20:14:47,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78922512] [2020-02-10 20:14:47,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:47,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78922512] [2020-02-10 20:14:47,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:47,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:47,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914378780] [2020-02-10 20:14:47,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:47,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:47,759 INFO L87 Difference]: Start difference. First operand 786 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:14:47,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:47,913 INFO L93 Difference]: Finished difference Result 1387 states and 4886 transitions. [2020-02-10 20:14:47,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:47,914 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:47,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:47,917 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:14:47,917 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:14:47,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:14:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 791. [2020-02-10 20:14:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:47,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 20:14:47,940 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:47,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:47,940 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 20:14:47,940 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:47,940 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 20:14:47,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:47,941 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:47,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, 1, 1, 1] [2020-02-10 20:14:47,941 INFO L427 AbstractCegarLoop]: === Iteration 269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:47,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:47,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1593380365, now seen corresponding path program 262 times [2020-02-10 20:14:47,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:47,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013072197] [2020-02-10 20:14:47,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013072197] [2020-02-10 20:14:48,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:48,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990443734] [2020-02-10 20:14:48,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:48,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:48,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:48,346 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:14:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:48,489 INFO L93 Difference]: Finished difference Result 1386 states and 4879 transitions. [2020-02-10 20:14:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:48,489 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:48,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:48,493 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:14:48,493 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:14:48,493 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:48,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:14:48,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 786. [2020-02-10 20:14:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:14:48,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3137 transitions. [2020-02-10 20:14:48,515 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3137 transitions. Word has length 25 [2020-02-10 20:14:48,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:48,515 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3137 transitions. [2020-02-10 20:14:48,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:48,515 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3137 transitions. [2020-02-10 20:14:48,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:48,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14: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, 1, 1, 1] [2020-02-10 20:14:48,517 INFO L427 AbstractCegarLoop]: === Iteration 270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:48,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:48,517 INFO L82 PathProgramCache]: Analyzing trace with hash -2120732839, now seen corresponding path program 263 times [2020-02-10 20:14:48,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:48,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309130849] [2020-02-10 20:14:48,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:48,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:48,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309130849] [2020-02-10 20:14:48,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:48,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:48,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466265943] [2020-02-10 20:14:48,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:48,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:48,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:48,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:48,926 INFO L87 Difference]: Start difference. First operand 786 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:14:49,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,089 INFO L93 Difference]: Finished difference Result 1379 states and 4865 transitions. [2020-02-10 20:14:49,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:49,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:49,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,093 INFO L225 Difference]: With dead ends: 1379 [2020-02-10 20:14:49,093 INFO L226 Difference]: Without dead ends: 1367 [2020-02-10 20:14:49,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:49,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2020-02-10 20:14:49,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 789. [2020-02-10 20:14:49,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:49,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 20:14:49,116 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 20:14:49,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,116 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 20:14:49,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:49,116 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 20:14:49,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:49,117 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,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, 1, 1, 1] [2020-02-10 20:14:49,117 INFO L427 AbstractCegarLoop]: === Iteration 271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1101149077, now seen corresponding path program 264 times [2020-02-10 20:14:49,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789207314] [2020-02-10 20:14:49,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:49,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:49,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789207314] [2020-02-10 20:14:49,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:49,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:49,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467267562] [2020-02-10 20:14:49,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:49,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:49,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:49,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:49,517 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:14:49,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:49,659 INFO L93 Difference]: Finished difference Result 1381 states and 4866 transitions. [2020-02-10 20:14:49,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:49,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:49,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:49,662 INFO L225 Difference]: With dead ends: 1381 [2020-02-10 20:14:49,663 INFO L226 Difference]: Without dead ends: 1358 [2020-02-10 20:14:49,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:49,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1358 states. [2020-02-10 20:14:49,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1358 to 780. [2020-02-10 20:14:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:14:49,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3124 transitions. [2020-02-10 20:14:49,687 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3124 transitions. Word has length 25 [2020-02-10 20:14:49,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:49,687 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3124 transitions. [2020-02-10 20:14:49,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:49,688 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3124 transitions. [2020-02-10 20:14:49,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:49,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:49,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, 1, 1, 1] [2020-02-10 20:14:49,689 INFO L427 AbstractCegarLoop]: === Iteration 272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:49,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:49,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1070968235, now seen corresponding path program 265 times [2020-02-10 20:14:49,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:49,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498557868] [2020-02-10 20:14:49,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:49,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,082 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498557868] [2020-02-10 20:14:50,082 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,082 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:50,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600232255] [2020-02-10 20:14:50,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:50,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:50,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:50,082 INFO L87 Difference]: Start difference. First operand 780 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:14:50,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,260 INFO L93 Difference]: Finished difference Result 1393 states and 4910 transitions. [2020-02-10 20:14:50,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:50,260 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:50,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,264 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:14:50,264 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:14:50,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:50,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:14:50,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 20:14:50,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:50,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3160 transitions. [2020-02-10 20:14:50,286 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3160 transitions. Word has length 25 [2020-02-10 20:14:50,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,287 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3160 transitions. [2020-02-10 20:14:50,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:50,287 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3160 transitions. [2020-02-10 20:14:50,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:50,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,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, 1, 1, 1] [2020-02-10 20:14:50,289 INFO L427 AbstractCegarLoop]: === Iteration 273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,289 INFO L82 PathProgramCache]: Analyzing trace with hash -100716621, now seen corresponding path program 266 times [2020-02-10 20:14:50,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084522946] [2020-02-10 20:14:50,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:50,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:50,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084522946] [2020-02-10 20:14:50,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:50,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:50,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716570418] [2020-02-10 20:14:50,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:50,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:50,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:50,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:50,679 INFO L87 Difference]: Start difference. First operand 791 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:14:50,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:50,836 INFO L93 Difference]: Finished difference Result 1395 states and 4910 transitions. [2020-02-10 20:14:50,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:50,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:50,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:50,839 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:14:50,840 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:14:50,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:50,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:14:50,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 20:14:50,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3150 transitions. [2020-02-10 20:14:50,862 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3150 transitions. Word has length 25 [2020-02-10 20:14:50,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:50,862 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3150 transitions. [2020-02-10 20:14:50,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:50,862 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3150 transitions. [2020-02-10 20:14:50,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:50,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:50,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:50,863 INFO L427 AbstractCegarLoop]: === Iteration 274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:50,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:50,863 INFO L82 PathProgramCache]: Analyzing trace with hash 855065843, now seen corresponding path program 267 times [2020-02-10 20:14:50,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:50,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738873649] [2020-02-10 20:14:50,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:50,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738873649] [2020-02-10 20:14:51,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:51,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938352194] [2020-02-10 20:14:51,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:51,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:51,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:51,277 INFO L87 Difference]: Start difference. First operand 787 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:14:51,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:51,449 INFO L93 Difference]: Finished difference Result 1389 states and 4898 transitions. [2020-02-10 20:14:51,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:51,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:51,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:51,453 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:14:51,453 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:14:51,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:51,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:14:51,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 20:14:51,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3155 transitions. [2020-02-10 20:14:51,475 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3155 transitions. Word has length 25 [2020-02-10 20:14:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:51,475 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3155 transitions. [2020-02-10 20:14:51,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3155 transitions. [2020-02-10 20:14:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:51,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:51,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, 1, 1, 1] [2020-02-10 20:14:51,477 INFO L427 AbstractCegarLoop]: === Iteration 275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:51,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:51,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1835820561, now seen corresponding path program 268 times [2020-02-10 20:14:51,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:51,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296439502] [2020-02-10 20:14:51,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:51,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:51,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296439502] [2020-02-10 20:14:51,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:51,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:51,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181352572] [2020-02-10 20:14:51,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:51,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:51,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:51,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:51,892 INFO L87 Difference]: Start difference. First operand 790 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:14:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,038 INFO L93 Difference]: Finished difference Result 1388 states and 4893 transitions. [2020-02-10 20:14:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:52,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,042 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:14:52,042 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:14:52,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:14:52,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:14:52,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:14:52,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3147 transitions. [2020-02-10 20:14:52,065 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3147 transitions. Word has length 25 [2020-02-10 20:14:52,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,065 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3147 transitions. [2020-02-10 20:14:52,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:52,065 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3147 transitions. [2020-02-10 20:14:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:52,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,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, 1, 1, 1] [2020-02-10 20:14:52,066 INFO L427 AbstractCegarLoop]: === Iteration 276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,066 INFO L82 PathProgramCache]: Analyzing trace with hash 237908565, now seen corresponding path program 269 times [2020-02-10 20:14:52,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042847384] [2020-02-10 20:14:52,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:52,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:52,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042847384] [2020-02-10 20:14:52,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:52,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:52,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892822079] [2020-02-10 20:14:52,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:52,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:52,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:52,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:52,474 INFO L87 Difference]: Start difference. First operand 787 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:14:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:52,633 INFO L93 Difference]: Finished difference Result 1393 states and 4903 transitions. [2020-02-10 20:14:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:52,633 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:52,637 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:14:52,637 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:14:52,637 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:52,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:14:52,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 790. [2020-02-10 20:14:52,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:14:52,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3152 transitions. [2020-02-10 20:14:52,661 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3152 transitions. Word has length 25 [2020-02-10 20:14:52,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:52,661 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3152 transitions. [2020-02-10 20:14:52,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:52,661 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3152 transitions. [2020-02-10 20:14:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:52,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:52,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, 1, 1, 1] [2020-02-10 20:14:52,662 INFO L427 AbstractCegarLoop]: === Iteration 277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:52,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:52,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1848849523, now seen corresponding path program 270 times [2020-02-10 20:14:52,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:52,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637483736] [2020-02-10 20:14:52,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:52,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637483736] [2020-02-10 20:14:53,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:53,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161367706] [2020-02-10 20:14:53,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:53,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:53,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:53,054 INFO L87 Difference]: Start difference. First operand 790 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:14:53,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,228 INFO L93 Difference]: Finished difference Result 1390 states and 4894 transitions. [2020-02-10 20:14:53,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:53,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:53,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,233 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:14:53,233 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:14:53,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:53,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:14:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 784. [2020-02-10 20:14:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:14:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3139 transitions. [2020-02-10 20:14:53,255 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3139 transitions. Word has length 25 [2020-02-10 20:14:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,255 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3139 transitions. [2020-02-10 20:14:53,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3139 transitions. [2020-02-10 20:14:53,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:53,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,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, 1, 1, 1] [2020-02-10 20:14:53,256 INFO L427 AbstractCegarLoop]: === Iteration 278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,257 INFO L82 PathProgramCache]: Analyzing trace with hash 1956541883, now seen corresponding path program 271 times [2020-02-10 20:14:53,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032402202] [2020-02-10 20:14:53,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:53,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:53,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032402202] [2020-02-10 20:14:53,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:53,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:53,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611844773] [2020-02-10 20:14:53,643 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:53,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:53,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:53,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:53,643 INFO L87 Difference]: Start difference. First operand 784 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:14:53,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:53,790 INFO L93 Difference]: Finished difference Result 1407 states and 4941 transitions. [2020-02-10 20:14:53,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:53,791 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:53,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:53,794 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:14:53,794 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:14:53,795 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:53,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:14:53,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 793. [2020-02-10 20:14:53,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:53,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3164 transitions. [2020-02-10 20:14:53,817 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3164 transitions. Word has length 25 [2020-02-10 20:14:53,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:53,817 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3164 transitions. [2020-02-10 20:14:53,817 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:53,817 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3164 transitions. [2020-02-10 20:14:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:53,818 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:53,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, 1, 1, 1] [2020-02-10 20:14:53,819 INFO L427 AbstractCegarLoop]: === Iteration 279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:53,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:53,819 INFO L82 PathProgramCache]: Analyzing trace with hash -1368173799, now seen corresponding path program 272 times [2020-02-10 20:14:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893854958] [2020-02-10 20:14:53,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:53,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893854958] [2020-02-10 20:14:54,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:54,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961974927] [2020-02-10 20:14:54,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:54,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:54,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:54,242 INFO L87 Difference]: Start difference. First operand 793 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:14:54,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,397 INFO L93 Difference]: Finished difference Result 1409 states and 4941 transitions. [2020-02-10 20:14:54,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:54,397 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:54,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,401 INFO L225 Difference]: With dead ends: 1409 [2020-02-10 20:14:54,401 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:14:54,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:54,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:14:54,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:14:54,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:54,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3153 transitions. [2020-02-10 20:14:54,424 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3153 transitions. Word has length 25 [2020-02-10 20:14:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:54,424 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3153 transitions. [2020-02-10 20:14:54,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3153 transitions. [2020-02-10 20:14:54,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:54,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:54,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, 1, 1, 1] [2020-02-10 20:14:54,425 INFO L427 AbstractCegarLoop]: === Iteration 280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:54,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:54,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1070743603, now seen corresponding path program 273 times [2020-02-10 20:14:54,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:54,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044670921] [2020-02-10 20:14:54,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:54,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:54,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:54,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044670921] [2020-02-10 20:14:54,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:54,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:54,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226198734] [2020-02-10 20:14:54,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:54,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:54,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:54,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:54,830 INFO L87 Difference]: Start difference. First operand 789 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:14:54,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:54,993 INFO L93 Difference]: Finished difference Result 1411 states and 4944 transitions. [2020-02-10 20:14:54,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:54,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:54,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:54,997 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:14:54,997 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:14:54,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:14:55,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:14:55,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:14:55,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:14:55,031 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:14:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,031 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:14:55,031 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:55,031 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:14:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:55,032 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,032 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:14:55,032 INFO L427 AbstractCegarLoop]: === Iteration 281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,032 INFO L82 PathProgramCache]: Analyzing trace with hash 2083007633, now seen corresponding path program 274 times [2020-02-10 20:14:55,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828574501] [2020-02-10 20:14:55,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:55,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:55,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828574501] [2020-02-10 20:14:55,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:55,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:55,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342346837] [2020-02-10 20:14:55,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:55,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:55,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:55,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:55,441 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:14:55,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:55,602 INFO L93 Difference]: Finished difference Result 1416 states and 4949 transitions. [2020-02-10 20:14:55,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:55,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:55,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:55,606 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:14:55,606 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:14:55,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:55,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:14:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:14:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:14:55,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3148 transitions. [2020-02-10 20:14:55,629 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3148 transitions. Word has length 25 [2020-02-10 20:14:55,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:55,629 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3148 transitions. [2020-02-10 20:14:55,629 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:55,629 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3148 transitions. [2020-02-10 20:14:55,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:55,630 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:55,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, 1, 1, 1] [2020-02-10 20:14:55,630 INFO L427 AbstractCegarLoop]: === Iteration 282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:55,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:55,630 INFO L82 PathProgramCache]: Analyzing trace with hash -52759941, now seen corresponding path program 275 times [2020-02-10 20:14:55,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:55,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48352128] [2020-02-10 20:14:55,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:55,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48352128] [2020-02-10 20:14:56,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:56,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824088547] [2020-02-10 20:14:56,034 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:56,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:56,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:56,034 INFO L87 Difference]: Start difference. First operand 789 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:14:56,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,191 INFO L93 Difference]: Finished difference Result 1417 states and 4953 transitions. [2020-02-10 20:14:56,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:56,192 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:56,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,195 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:14:56,195 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:14:56,195 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:56,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:14:56,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 796. [2020-02-10 20:14:56,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:14:56,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3161 transitions. [2020-02-10 20:14:56,219 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3161 transitions. Word has length 25 [2020-02-10 20:14:56,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,219 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3161 transitions. [2020-02-10 20:14:56,219 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:56,219 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3161 transitions. [2020-02-10 20:14:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:56,220 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,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, 1, 1, 1] [2020-02-10 20:14:56,220 INFO L427 AbstractCegarLoop]: === Iteration 283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,221 INFO L82 PathProgramCache]: Analyzing trace with hash 2096036595, now seen corresponding path program 276 times [2020-02-10 20:14:56,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199888412] [2020-02-10 20:14:56,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:56,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:56,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199888412] [2020-02-10 20:14:56,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:56,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:56,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728290284] [2020-02-10 20:14:56,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:56,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:56,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:56,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:56,620 INFO L87 Difference]: Start difference. First operand 796 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:14:56,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:56,744 INFO L93 Difference]: Finished difference Result 1420 states and 4952 transitions. [2020-02-10 20:14:56,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:56,745 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:56,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:56,749 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:14:56,749 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:14:56,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:56,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:14:56,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 784. [2020-02-10 20:14:56,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:14:56,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3135 transitions. [2020-02-10 20:14:56,771 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3135 transitions. Word has length 25 [2020-02-10 20:14:56,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:56,772 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3135 transitions. [2020-02-10 20:14:56,772 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:56,772 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3135 transitions. [2020-02-10 20:14:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:56,773 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:56,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, 1, 1, 1] [2020-02-10 20:14:56,773 INFO L427 AbstractCegarLoop]: === Iteration 284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:56,773 INFO L82 PathProgramCache]: Analyzing trace with hash -834877061, now seen corresponding path program 277 times [2020-02-10 20:14:56,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:56,773 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788151965] [2020-02-10 20:14:56,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:56,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:57,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788151965] [2020-02-10 20:14:57,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:57,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050627154] [2020-02-10 20:14:57,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:57,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:57,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:57,170 INFO L87 Difference]: Start difference. First operand 784 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:14:57,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,345 INFO L93 Difference]: Finished difference Result 1395 states and 4906 transitions. [2020-02-10 20:14:57,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:57,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:57,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,348 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:14:57,348 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:14:57,349 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:57,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:14:57,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 791. [2020-02-10 20:14:57,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:14:57,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3154 transitions. [2020-02-10 20:14:57,371 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3154 transitions. Word has length 25 [2020-02-10 20:14:57,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,371 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3154 transitions. [2020-02-10 20:14:57,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:57,371 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3154 transitions. [2020-02-10 20:14:57,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:57,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,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, 1, 1, 1] [2020-02-10 20:14:57,372 INFO L427 AbstractCegarLoop]: === Iteration 285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,373 INFO L82 PathProgramCache]: Analyzing trace with hash 145877657, now seen corresponding path program 278 times [2020-02-10 20:14:57,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705349665] [2020-02-10 20:14:57,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:57,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 20:14:57,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705349665] [2020-02-10 20:14:57,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:57,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:57,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081370924] [2020-02-10 20:14:57,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:57,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:57,765 INFO L87 Difference]: Start difference. First operand 791 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:14:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:57,944 INFO L93 Difference]: Finished difference Result 1394 states and 4901 transitions. [2020-02-10 20:14:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:57,945 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:57,949 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 20:14:57,949 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:14:57,949 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:57,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:14:57,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 788. [2020-02-10 20:14:57,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:14:57,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3146 transitions. [2020-02-10 20:14:57,973 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3146 transitions. Word has length 25 [2020-02-10 20:14:57,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:57,973 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3146 transitions. [2020-02-10 20:14:57,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:57,973 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3146 transitions. [2020-02-10 20:14:57,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:57,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:57,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, 1, 1, 1] [2020-02-10 20:14:57,974 INFO L427 AbstractCegarLoop]: === Iteration 286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:57,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:57,974 INFO L82 PathProgramCache]: Analyzing trace with hash 648257877, now seen corresponding path program 279 times [2020-02-10 20:14:57,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:57,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264445990] [2020-02-10 20:14:57,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264445990] [2020-02-10 20:14:58,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:58,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538334785] [2020-02-10 20:14:58,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:58,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:58,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:58,374 INFO L87 Difference]: Start difference. First operand 788 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:14:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:58,530 INFO L93 Difference]: Finished difference Result 1403 states and 4919 transitions. [2020-02-10 20:14:58,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:58,531 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:58,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:58,534 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:14:58,534 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:14:58,534 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:58,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:14:58,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 793. [2020-02-10 20:14:58,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:14:58,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3155 transitions. [2020-02-10 20:14:58,556 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3155 transitions. Word has length 25 [2020-02-10 20:14:58,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:58,556 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3155 transitions. [2020-02-10 20:14:58,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:58,557 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3155 transitions. [2020-02-10 20:14:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:58,558 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:58,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, 1, 1, 1] [2020-02-10 20:14:58,558 INFO L427 AbstractCegarLoop]: === Iteration 287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1660521907, now seen corresponding path program 280 times [2020-02-10 20:14:58,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:58,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143508567] [2020-02-10 20:14:58,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:58,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:58,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:58,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143508567] [2020-02-10 20:14:58,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:58,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:58,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592576004] [2020-02-10 20:14:58,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:58,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:58,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:58,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:58,987 INFO L87 Difference]: Start difference. First operand 793 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:14:59,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,132 INFO L93 Difference]: Finished difference Result 1408 states and 4924 transitions. [2020-02-10 20:14:59,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:59,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:59,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,136 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:14:59,136 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:14:59,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:59,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:14:59,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:14:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:14:59,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:14:59,158 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:14:59,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,158 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:14:59,158 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:59,158 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:14:59,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:59,159 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,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, 1, 1, 1] [2020-02-10 20:14:59,160 INFO L427 AbstractCegarLoop]: === Iteration 288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1461291515, now seen corresponding path program 281 times [2020-02-10 20:14:59,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409805862] [2020-02-10 20:14:59,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:14:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:14:59,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409805862] [2020-02-10 20:14:59,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:14:59,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:14:59,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248358090] [2020-02-10 20:14:59,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:14:59,556 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:14:59,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:14:59,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:14:59,556 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:14:59,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:14:59,731 INFO L93 Difference]: Finished difference Result 1400 states and 4908 transitions. [2020-02-10 20:14:59,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:14:59,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:14:59,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:14:59,735 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:14:59,736 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:14:59,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:14:59,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:14:59,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:14:59,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:14:59,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:14:59,758 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:14:59,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:14:59,758 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:14:59,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:14:59,758 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:14:59,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:14:59,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:14:59,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, 1, 1, 1] [2020-02-10 20:14:59,759 INFO L427 AbstractCegarLoop]: === Iteration 289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:14:59,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:14:59,760 INFO L82 PathProgramCache]: Analyzing trace with hash 1999147093, now seen corresponding path program 282 times [2020-02-10 20:14:59,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:14:59,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732592257] [2020-02-10 20:14:59,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:14:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732592257] [2020-02-10 20:15:00,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:00,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656499] [2020-02-10 20:15:00,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:00,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:00,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:00,162 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:15:00,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,287 INFO L93 Difference]: Finished difference Result 1406 states and 4916 transitions. [2020-02-10 20:15:00,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:00,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:00,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,292 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:15:00,292 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:15:00,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:00,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:15:00,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 20:15:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 20:15:00,314 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 20:15:00,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,314 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 20:15:00,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:00,315 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 20:15:00,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:00,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,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, 1, 1, 1] [2020-02-10 20:15:00,316 INFO L427 AbstractCegarLoop]: === Iteration 290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1933934797, now seen corresponding path program 283 times [2020-02-10 20:15:00,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572975993] [2020-02-10 20:15:00,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:00,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:00,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572975993] [2020-02-10 20:15:00,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:00,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:00,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292002591] [2020-02-10 20:15:00,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:00,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:00,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:00,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:00,714 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:15:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:00,883 INFO L93 Difference]: Finished difference Result 1403 states and 4920 transitions. [2020-02-10 20:15:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:00,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:00,887 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:15:00,887 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:15:00,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:00,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:15:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 791. [2020-02-10 20:15:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:00,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:15:00,910 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:00,910 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:15:00,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:15:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:00,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:00,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:00,911 INFO L427 AbstractCegarLoop]: === Iteration 291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:00,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:00,912 INFO L82 PathProgramCache]: Analyzing trace with hash -322993839, now seen corresponding path program 284 times [2020-02-10 20:15:00,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:00,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729248372] [2020-02-10 20:15:00,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729248372] [2020-02-10 20:15:01,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931590754] [2020-02-10 20:15:01,307 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:01,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:01,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:01,307 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:01,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:01,470 INFO L93 Difference]: Finished difference Result 1400 states and 4911 transitions. [2020-02-10 20:15:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:01,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:01,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:01,474 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:15:01,474 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:15:01,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:01,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:15:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 788. [2020-02-10 20:15:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:01,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:15:01,496 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:15:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:01,496 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:15:01,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:15:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:01,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:01,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, 1, 1, 1] [2020-02-10 20:15:01,497 INFO L427 AbstractCegarLoop]: === Iteration 292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:01,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1854686233, now seen corresponding path program 285 times [2020-02-10 20:15:01,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:01,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253722630] [2020-02-10 20:15:01,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:01,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253722630] [2020-02-10 20:15:01,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:01,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:01,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119390646] [2020-02-10 20:15:01,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:01,896 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:01,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:01,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:01,897 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:15:02,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,053 INFO L93 Difference]: Finished difference Result 1413 states and 4939 transitions. [2020-02-10 20:15:02,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:02,053 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:02,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,057 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:15:02,057 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:15:02,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:02,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:15:02,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 795. [2020-02-10 20:15:02,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:02,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:15:02,080 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:15:02,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,080 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:15:02,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:02,080 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:15:02,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:02,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:02,081 INFO L427 AbstractCegarLoop]: === Iteration 293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,081 INFO L82 PathProgramCache]: Analyzing trace with hash -291484527, now seen corresponding path program 286 times [2020-02-10 20:15:02,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768953254] [2020-02-10 20:15:02,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:02,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 20:15:02,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768953254] [2020-02-10 20:15:02,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:02,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:02,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233482361] [2020-02-10 20:15:02,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:02,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:02,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:02,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:02,487 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:15:02,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:02,601 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 20:15:02,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:02,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:02,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:02,606 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:15:02,606 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:15:02,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:02,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:15:02,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 788. [2020-02-10 20:15:02,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:02,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:15:02,639 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:15:02,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:02,639 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:15:02,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:02,640 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:15:02,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:02,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:02,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, 1, 1, 1] [2020-02-10 20:15:02,641 INFO L427 AbstractCegarLoop]: === Iteration 294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:02,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:02,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1865189337, now seen corresponding path program 287 times [2020-02-10 20:15:02,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:02,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410286600] [2020-02-10 20:15:02,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,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 20:15:03,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410286600] [2020-02-10 20:15:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:03,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332758655] [2020-02-10 20:15:03,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:03,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:03,037 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:15:03,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,199 INFO L93 Difference]: Finished difference Result 1404 states and 4914 transitions. [2020-02-10 20:15:03,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:03,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:03,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,202 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:15:03,203 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:15:03,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:03,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:15:03,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 792. [2020-02-10 20:15:03,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:15:03,225 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:15:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,225 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:15:03,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:03,225 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:15:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:03,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,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, 1, 1, 1] [2020-02-10 20:15:03,226 INFO L427 AbstractCegarLoop]: === Iteration 295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1891922381, now seen corresponding path program 288 times [2020-02-10 20:15:03,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798892884] [2020-02-10 20:15:03,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:03,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:03,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798892884] [2020-02-10 20:15:03,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:03,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:03,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765888712] [2020-02-10 20:15:03,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:03,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:03,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:03,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:03,646 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:15:03,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:03,794 INFO L93 Difference]: Finished difference Result 1410 states and 4922 transitions. [2020-02-10 20:15:03,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:03,795 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:03,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:03,799 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:15:03,799 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:15:03,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:15:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 780. [2020-02-10 20:15:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:15:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3120 transitions. [2020-02-10 20:15:03,821 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3120 transitions. Word has length 25 [2020-02-10 20:15:03,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:03,822 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3120 transitions. [2020-02-10 20:15:03,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3120 transitions. [2020-02-10 20:15:03,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:03,823 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:03,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:03,823 INFO L427 AbstractCegarLoop]: === Iteration 296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1954716373, now seen corresponding path program 289 times [2020-02-10 20:15:03,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:03,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104520350] [2020-02-10 20:15:03,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104520350] [2020-02-10 20:15:04,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:04,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748943317] [2020-02-10 20:15:04,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:04,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:04,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:04,227 INFO L87 Difference]: Start difference. First operand 780 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:15:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,399 INFO L93 Difference]: Finished difference Result 1411 states and 4963 transitions. [2020-02-10 20:15:04,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:04,400 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,403 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:15:04,404 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:15:04,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:04,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:15:04,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:15:04,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:15:04,426 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:15:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:04,426 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:15:04,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:15:04,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:04,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:04,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, 1, 1, 1] [2020-02-10 20:15:04,428 INFO L427 AbstractCegarLoop]: === Iteration 297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:04,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:04,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1369999309, now seen corresponding path program 290 times [2020-02-10 20:15:04,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:04,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215485145] [2020-02-10 20:15:04,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:04,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:04,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215485145] [2020-02-10 20:15:04,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:04,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:04,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386287419] [2020-02-10 20:15:04,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:04,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:04,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:04,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:04,829 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:15:04,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:04,987 INFO L93 Difference]: Finished difference Result 1413 states and 4963 transitions. [2020-02-10 20:15:04,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:04,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:04,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:04,991 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:15:04,991 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:15:04,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:05,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:15:05,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:15:05,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:05,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:15:05,014 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:15:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,014 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:15:05,014 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:15:05,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:05,015 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15: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, 1, 1, 1] [2020-02-10 20:15:05,016 INFO L427 AbstractCegarLoop]: === Iteration 298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,016 INFO L82 PathProgramCache]: Analyzing trace with hash -857115985, now seen corresponding path program 291 times [2020-02-10 20:15:05,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194114103] [2020-02-10 20:15:05,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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 20:15:05,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194114103] [2020-02-10 20:15:05,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:05,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:05,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004643387] [2020-02-10 20:15:05,424 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:05,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:05,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:05,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:05,424 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:15:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:05,595 INFO L93 Difference]: Finished difference Result 1410 states and 4957 transitions. [2020-02-10 20:15:05,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:05,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:05,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:05,599 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:15:05,599 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:15:05,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:15:05,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 793. [2020-02-10 20:15:05,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:05,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:15:05,622 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:15:05,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:05,622 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:15:05,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:05,622 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:15:05,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:05,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:05,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, 1, 1, 1] [2020-02-10 20:15:05,623 INFO L427 AbstractCegarLoop]: === Iteration 299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:05,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:05,624 INFO L82 PathProgramCache]: Analyzing trace with hash 144644941, now seen corresponding path program 292 times [2020-02-10 20:15:05,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:05,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335949383] [2020-02-10 20:15:05,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:05,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,031 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335949383] [2020-02-10 20:15:06,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:06,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016704420] [2020-02-10 20:15:06,032 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:06,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:06,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:06,033 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:15:06,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,212 INFO L93 Difference]: Finished difference Result 1411 states and 4955 transitions. [2020-02-10 20:15:06,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:06,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:06,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,217 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:15:06,217 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:15:06,218 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:06,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:15:06,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:15:06,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:06,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 20:15:06,242 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:06,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,242 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 20:15:06,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:06,242 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 20:15:06,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:06,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,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, 1, 1, 1] [2020-02-10 20:15:06,244 INFO L427 AbstractCegarLoop]: === Iteration 300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,244 INFO L82 PathProgramCache]: Analyzing trace with hash -380181675, now seen corresponding path program 293 times [2020-02-10 20:15:06,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133834677] [2020-02-10 20:15:06,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:06,668 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133834677] [2020-02-10 20:15:06,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:06,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:06,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637961214] [2020-02-10 20:15:06,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:06,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:06,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:06,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:06,669 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:06,808 INFO L93 Difference]: Finished difference Result 1415 states and 4964 transitions. [2020-02-10 20:15:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:06,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:06,812 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:15:06,812 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:15:06,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:15:06,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 794. [2020-02-10 20:15:06,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:06,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 20:15:06,842 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 20:15:06,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:06,842 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 20:15:06,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:06,842 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 20:15:06,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:06,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:06,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:06,843 INFO L427 AbstractCegarLoop]: === Iteration 301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:06,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:06,843 INFO L82 PathProgramCache]: Analyzing trace with hash 157673903, now seen corresponding path program 294 times [2020-02-10 20:15:06,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:06,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008013824] [2020-02-10 20:15:06,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008013824] [2020-02-10 20:15:07,251 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,251 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:07,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536116258] [2020-02-10 20:15:07,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:07,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:07,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:07,252 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:15:07,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:07,424 INFO L93 Difference]: Finished difference Result 1414 states and 4957 transitions. [2020-02-10 20:15:07,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:07,425 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:07,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:07,428 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:15:07,428 INFO L226 Difference]: Without dead ends: 1391 [2020-02-10 20:15:07,428 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1391 states. [2020-02-10 20:15:07,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1391 to 785. [2020-02-10 20:15:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:15:07,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3139 transitions. [2020-02-10 20:15:07,450 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3139 transitions. Word has length 25 [2020-02-10 20:15:07,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:07,451 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3139 transitions. [2020-02-10 20:15:07,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:07,451 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3139 transitions. [2020-02-10 20:15:07,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:07,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:07,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, 1, 1, 1] [2020-02-10 20:15:07,452 INFO L427 AbstractCegarLoop]: === Iteration 302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:07,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:07,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1532230647, now seen corresponding path program 295 times [2020-02-10 20:15:07,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:07,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277201422] [2020-02-10 20:15:07,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:07,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:07,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:07,840 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277201422] [2020-02-10 20:15:07,840 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:07,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:07,840 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027902137] [2020-02-10 20:15:07,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:07,840 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:07,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:07,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:07,841 INFO L87 Difference]: Start difference. First operand 785 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:15:08,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,014 INFO L93 Difference]: Finished difference Result 1419 states and 4976 transitions. [2020-02-10 20:15:08,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:08,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:08,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,017 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:15:08,017 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:15:08,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:08,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:15:08,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:15:08,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:08,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3164 transitions. [2020-02-10 20:15:08,039 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3164 transitions. Word has length 25 [2020-02-10 20:15:08,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,039 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3164 transitions. [2020-02-10 20:15:08,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:08,039 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3164 transitions. [2020-02-10 20:15:08,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:08,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,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, 1, 1, 1] [2020-02-10 20:15:08,041 INFO L427 AbstractCegarLoop]: === Iteration 303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1792485035, now seen corresponding path program 296 times [2020-02-10 20:15:08,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059259290] [2020-02-10 20:15:08,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:08,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:08,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059259290] [2020-02-10 20:15:08,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:08,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:08,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301299235] [2020-02-10 20:15:08,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:08,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:08,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:08,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:08,440 INFO L87 Difference]: Start difference. First operand 794 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:15:08,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:08,598 INFO L93 Difference]: Finished difference Result 1421 states and 4976 transitions. [2020-02-10 20:15:08,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:08,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:08,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:08,603 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:15:08,603 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:15:08,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:08,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:15:08,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:15:08,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:08,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3153 transitions. [2020-02-10 20:15:08,625 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3153 transitions. Word has length 25 [2020-02-10 20:15:08,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:08,626 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3153 transitions. [2020-02-10 20:15:08,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:08,626 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3153 transitions. [2020-02-10 20:15:08,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:08,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:08,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:08,627 INFO L427 AbstractCegarLoop]: === Iteration 304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:08,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:08,627 INFO L82 PathProgramCache]: Analyzing trace with hash 646432367, now seen corresponding path program 297 times [2020-02-10 20:15:08,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:08,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733519634] [2020-02-10 20:15:08,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:08,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733519634] [2020-02-10 20:15:09,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:09,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270643541] [2020-02-10 20:15:09,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:09,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:09,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:09,029 INFO L87 Difference]: Start difference. First operand 790 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:15:09,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,204 INFO L93 Difference]: Finished difference Result 1423 states and 4979 transitions. [2020-02-10 20:15:09,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:09,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:09,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,208 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:15:09,208 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:15:09,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:09,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:15:09,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 795. [2020-02-10 20:15:09,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3162 transitions. [2020-02-10 20:15:09,230 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3162 transitions. Word has length 25 [2020-02-10 20:15:09,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,230 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3162 transitions. [2020-02-10 20:15:09,230 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:09,231 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3162 transitions. [2020-02-10 20:15:09,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:09,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,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, 1, 1, 1] [2020-02-10 20:15:09,232 INFO L427 AbstractCegarLoop]: === Iteration 305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1658696397, now seen corresponding path program 298 times [2020-02-10 20:15:09,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506747421] [2020-02-10 20:15:09,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:09,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:09,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506747421] [2020-02-10 20:15:09,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:09,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:09,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198271876] [2020-02-10 20:15:09,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:09,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:09,641 INFO L87 Difference]: Start difference. First operand 795 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:15:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:09,780 INFO L93 Difference]: Finished difference Result 1428 states and 4984 transitions. [2020-02-10 20:15:09,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:09,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:09,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:09,783 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:15:09,783 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:15:09,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:09,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:15:09,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 790. [2020-02-10 20:15:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:09,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:15:09,806 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:15:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:09,806 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:15:09,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:09,807 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:15:09,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:09,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:09,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, 1, 1, 1] [2020-02-10 20:15:09,808 INFO L427 AbstractCegarLoop]: === Iteration 306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:09,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:09,808 INFO L82 PathProgramCache]: Analyzing trace with hash -477071177, now seen corresponding path program 299 times [2020-02-10 20:15:09,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:09,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1017918891] [2020-02-10 20:15:09,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:09,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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 20:15:10,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1017918891] [2020-02-10 20:15:10,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:10,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581428438] [2020-02-10 20:15:10,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:10,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:10,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:10,233 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:15:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,392 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:15:10,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:10,393 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:10,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,396 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:15:10,396 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:15:10,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:15:10,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 797. [2020-02-10 20:15:10,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:10,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:15:10,431 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:15:10,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,431 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:15:10,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:10,431 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:15:10,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:10,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:10,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, 1, 1, 1] [2020-02-10 20:15:10,432 INFO L427 AbstractCegarLoop]: === Iteration 307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:10,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:10,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1671725359, now seen corresponding path program 300 times [2020-02-10 20:15:10,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:10,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925653045] [2020-02-10 20:15:10,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:10,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:10,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:10,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925653045] [2020-02-10 20:15:10,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:10,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:10,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207203182] [2020-02-10 20:15:10,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:10,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:10,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:10,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:10,844 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:15:10,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:10,971 INFO L93 Difference]: Finished difference Result 1432 states and 4987 transitions. [2020-02-10 20:15:10,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:10,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:10,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:10,976 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:15:10,976 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:15:10,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:10,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:15:10,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 785. [2020-02-10 20:15:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:15:10,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3134 transitions. [2020-02-10 20:15:10,998 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3134 transitions. Word has length 25 [2020-02-10 20:15:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:10,999 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3134 transitions. [2020-02-10 20:15:10,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3134 transitions. [2020-02-10 20:15:11,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:11,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,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, 1, 1, 1] [2020-02-10 20:15:11,000 INFO L427 AbstractCegarLoop]: === Iteration 308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1747908407, now seen corresponding path program 301 times [2020-02-10 20:15:11,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628628852] [2020-02-10 20:15:11,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:11,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:11,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628628852] [2020-02-10 20:15:11,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:11,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:11,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626503606] [2020-02-10 20:15:11,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:11,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:11,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:11,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:11,416 INFO L87 Difference]: Start difference. First operand 785 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:15:11,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:11,586 INFO L93 Difference]: Finished difference Result 1416 states and 4964 transitions. [2020-02-10 20:15:11,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:11,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:11,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:11,590 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:15:11,590 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:15:11,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:11,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:15:11,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 794. [2020-02-10 20:15:11,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3159 transitions. [2020-02-10 20:15:11,613 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3159 transitions. Word has length 25 [2020-02-10 20:15:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:11,614 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3159 transitions. [2020-02-10 20:15:11,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3159 transitions. [2020-02-10 20:15:11,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:11,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:11,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, 1, 1, 1] [2020-02-10 20:15:11,615 INFO L427 AbstractCegarLoop]: === Iteration 309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:11,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:11,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1545297963, now seen corresponding path program 302 times [2020-02-10 20:15:11,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:11,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624765779] [2020-02-10 20:15:11,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:11,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624765779] [2020-02-10 20:15:12,026 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:12,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273834166] [2020-02-10 20:15:12,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:12,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:12,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:12,026 INFO L87 Difference]: Start difference. First operand 794 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:15:12,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,166 INFO L93 Difference]: Finished difference Result 1417 states and 4962 transitions. [2020-02-10 20:15:12,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:12,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:12,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,171 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:15:12,171 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:15:12,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:12,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:15:12,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:15:12,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:12,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3148 transitions. [2020-02-10 20:15:12,193 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3148 transitions. Word has length 25 [2020-02-10 20:15:12,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,193 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3148 transitions. [2020-02-10 20:15:12,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:12,194 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3148 transitions. [2020-02-10 20:15:12,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:12,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,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, 1, 1, 1] [2020-02-10 20:15:12,195 INFO L427 AbstractCegarLoop]: === Iteration 310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,195 INFO L82 PathProgramCache]: Analyzing trace with hash -621024811, now seen corresponding path program 303 times [2020-02-10 20:15:12,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299388888] [2020-02-10 20:15:12,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:12,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:12,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299388888] [2020-02-10 20:15:12,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:12,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:12,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704623713] [2020-02-10 20:15:12,595 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:12,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:12,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:12,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:12,595 INFO L87 Difference]: Start difference. First operand 790 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:15:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:12,735 INFO L93 Difference]: Finished difference Result 1421 states and 4969 transitions. [2020-02-10 20:15:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:12,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:12,739 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:15:12,739 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:15:12,739 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:12,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:15:12,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 795. [2020-02-10 20:15:12,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:12,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3157 transitions. [2020-02-10 20:15:12,762 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3157 transitions. Word has length 25 [2020-02-10 20:15:12,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:12,762 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3157 transitions. [2020-02-10 20:15:12,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:12,762 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3157 transitions. [2020-02-10 20:15:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:12,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:12,763 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:12,763 INFO L427 AbstractCegarLoop]: === Iteration 311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:12,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:12,763 INFO L82 PathProgramCache]: Analyzing trace with hash 391239219, now seen corresponding path program 304 times [2020-02-10 20:15:12,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:12,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217167052] [2020-02-10 20:15:12,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:12,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217167052] [2020-02-10 20:15:13,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,167 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:13,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072866275] [2020-02-10 20:15:13,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:13,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:13,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:13,167 INFO L87 Difference]: Start difference. First operand 795 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:15:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,288 INFO L93 Difference]: Finished difference Result 1426 states and 4974 transitions. [2020-02-10 20:15:13,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:13,288 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:13,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,291 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:15:13,291 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:15:13,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:13,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:15:13,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:15:13,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:13,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 20:15:13,314 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 20:15:13,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,314 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 20:15:13,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:13,314 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 20:15:13,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:13,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,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, 1, 1, 1] [2020-02-10 20:15:13,315 INFO L427 AbstractCegarLoop]: === Iteration 312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,315 INFO L82 PathProgramCache]: Analyzing trace with hash -229884105, now seen corresponding path program 305 times [2020-02-10 20:15:13,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778868819] [2020-02-10 20:15:13,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:13,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:13,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778868819] [2020-02-10 20:15:13,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:13,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:13,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496586610] [2020-02-10 20:15:13,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:13,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:13,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:13,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:13,715 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:15:13,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:13,912 INFO L93 Difference]: Finished difference Result 1424 states and 4971 transitions. [2020-02-10 20:15:13,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:13,913 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:13,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:13,916 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:15:13,916 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:15:13,917 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:13,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:15:13,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 796. [2020-02-10 20:15:13,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:15:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 20:15:13,939 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 20:15:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:13,939 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 20:15:13,939 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 20:15:13,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:13,940 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:13,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, 1, 1, 1] [2020-02-10 20:15:13,940 INFO L427 AbstractCegarLoop]: === Iteration 313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:13,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:13,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1381056853, now seen corresponding path program 306 times [2020-02-10 20:15:13,941 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:13,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806306633] [2020-02-10 20:15:13,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806306633] [2020-02-10 20:15:14,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:14,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162168813] [2020-02-10 20:15:14,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:14,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:14,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:14,363 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:15:14,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:14,512 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:15:14,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:14,512 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:14,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:14,516 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:15:14,516 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:15:14,516 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:14,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:15:14,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 785. [2020-02-10 20:15:14,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:15:14,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3129 transitions. [2020-02-10 20:15:14,538 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3129 transitions. Word has length 25 [2020-02-10 20:15:14,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:14,539 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3129 transitions. [2020-02-10 20:15:14,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:14,539 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3129 transitions. [2020-02-10 20:15:14,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:14,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:14,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, 1, 1, 1] [2020-02-10 20:15:14,540 INFO L427 AbstractCegarLoop]: === Iteration 314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:14,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1742942259, now seen corresponding path program 307 times [2020-02-10 20:15:14,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:14,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117472263] [2020-02-10 20:15:14,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:14,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:14,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117472263] [2020-02-10 20:15:14,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:14,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:14,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219583822] [2020-02-10 20:15:14,956 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:14,956 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:14,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:14,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:14,956 INFO L87 Difference]: Start difference. First operand 785 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:15:15,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,106 INFO L93 Difference]: Finished difference Result 1427 states and 4987 transitions. [2020-02-10 20:15:15,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:15,106 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:15,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,110 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:15:15,110 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:15:15,110 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:15,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:15:15,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 796. [2020-02-10 20:15:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:15:15,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3160 transitions. [2020-02-10 20:15:15,133 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3160 transitions. Word has length 25 [2020-02-10 20:15:15,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,133 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3160 transitions. [2020-02-10 20:15:15,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3160 transitions. [2020-02-10 20:15:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:15,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,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, 1, 1, 1] [2020-02-10 20:15:15,135 INFO L427 AbstractCegarLoop]: === Iteration 315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,135 INFO L82 PathProgramCache]: Analyzing trace with hash -2014169459, now seen corresponding path program 308 times [2020-02-10 20:15:15,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085824273] [2020-02-10 20:15:15,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:15,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:15,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085824273] [2020-02-10 20:15:15,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:15,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:15,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864976947] [2020-02-10 20:15:15,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:15,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:15,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:15,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:15,544 INFO L87 Difference]: Start difference. First operand 796 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:15:15,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:15,739 INFO L93 Difference]: Finished difference Result 1426 states and 4980 transitions. [2020-02-10 20:15:15,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:15,740 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:15,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:15,743 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:15:15,744 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:15:15,744 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:15,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:15:15,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 791. [2020-02-10 20:15:15,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:15,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:15:15,766 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:15:15,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:15,766 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:15:15,766 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:15,766 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:15:15,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:15,767 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:15,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, 1, 1, 1] [2020-02-10 20:15:15,767 INFO L427 AbstractCegarLoop]: === Iteration 316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:15,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:15,768 INFO L82 PathProgramCache]: Analyzing trace with hash 142504405, now seen corresponding path program 309 times [2020-02-10 20:15:15,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:15,768 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179169437] [2020-02-10 20:15:15,768 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179169437] [2020-02-10 20:15:16,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:16,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156596520] [2020-02-10 20:15:16,178 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:16,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:16,178 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:15:16,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,356 INFO L93 Difference]: Finished difference Result 1433 states and 4994 transitions. [2020-02-10 20:15:16,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:16,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:16,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,360 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:15:16,360 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:15:16,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:16,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:15:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 798. [2020-02-10 20:15:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:15:16,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3159 transitions. [2020-02-10 20:15:16,383 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3159 transitions. Word has length 25 [2020-02-10 20:15:16,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:16,383 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3159 transitions. [2020-02-10 20:15:16,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:16,383 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3159 transitions. [2020-02-10 20:15:16,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:16,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:16,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, 1, 1, 1] [2020-02-10 20:15:16,384 INFO L427 AbstractCegarLoop]: === Iteration 317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:16,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:16,384 INFO L82 PathProgramCache]: Analyzing trace with hash -2003666355, now seen corresponding path program 310 times [2020-02-10 20:15:16,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:16,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232122165] [2020-02-10 20:15:16,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:16,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:16,807 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:16,807 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232122165] [2020-02-10 20:15:16,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:16,807 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:16,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262153940] [2020-02-10 20:15:16,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:16,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:16,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:16,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:16,808 INFO L87 Difference]: Start difference. First operand 798 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:15:16,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:16,985 INFO L93 Difference]: Finished difference Result 1436 states and 4993 transitions. [2020-02-10 20:15:16,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:16,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:16,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:16,990 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:15:16,990 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:15:16,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:17,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:15:17,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 791. [2020-02-10 20:15:17,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 20:15:17,015 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 20:15:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,015 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 20:15:17,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 20:15:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:17,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,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, 1, 1, 1] [2020-02-10 20:15:17,016 INFO L427 AbstractCegarLoop]: === Iteration 318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash 174013717, now seen corresponding path program 311 times [2020-02-10 20:15:17,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443587291] [2020-02-10 20:15:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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 20:15:17,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443587291] [2020-02-10 20:15:17,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:17,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:17,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106893787] [2020-02-10 20:15:17,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:17,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:17,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:17,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:17,440 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:15:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:17,632 INFO L93 Difference]: Finished difference Result 1430 states and 4981 transitions. [2020-02-10 20:15:17,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:17,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:17,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:17,636 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:15:17,636 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:15:17,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:17,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:15:17,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 797. [2020-02-10 20:15:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:17,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3151 transitions. [2020-02-10 20:15:17,658 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3151 transitions. Word has length 25 [2020-02-10 20:15:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:17,658 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3151 transitions. [2020-02-10 20:15:17,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:17,659 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3151 transitions. [2020-02-10 20:15:17,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:17,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:17,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, 1, 1, 1] [2020-02-10 20:15:17,660 INFO L427 AbstractCegarLoop]: === Iteration 319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:17,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1784954675, now seen corresponding path program 312 times [2020-02-10 20:15:17,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:17,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951707864] [2020-02-10 20:15:17,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:17,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951707864] [2020-02-10 20:15:18,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:18,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759156893] [2020-02-10 20:15:18,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:18,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:18,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:18,070 INFO L87 Difference]: Start difference. First operand 797 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:15:18,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,268 INFO L93 Difference]: Finished difference Result 1434 states and 4983 transitions. [2020-02-10 20:15:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:18,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:18,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,272 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:15:18,272 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:15:18,272 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:18,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:15:18,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 780. [2020-02-10 20:15:18,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:15:18,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3116 transitions. [2020-02-10 20:15:18,294 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3116 transitions. Word has length 25 [2020-02-10 20:15:18,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,294 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3116 transitions. [2020-02-10 20:15:18,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:18,294 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3116 transitions. [2020-02-10 20:15:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:18,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,295 INFO L427 AbstractCegarLoop]: === Iteration 320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1048858189, now seen corresponding path program 313 times [2020-02-10 20:15:18,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919484853] [2020-02-10 20:15:18,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:18,709 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919484853] [2020-02-10 20:15:18,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:18,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:18,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476267113] [2020-02-10 20:15:18,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:18,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:18,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:18,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:18,710 INFO L87 Difference]: Start difference. First operand 780 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:15:18,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:18,902 INFO L93 Difference]: Finished difference Result 1386 states and 4886 transitions. [2020-02-10 20:15:18,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:18,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:18,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:18,906 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:15:18,906 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:15:18,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:18,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:15:18,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 790. [2020-02-10 20:15:18,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:18,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3150 transitions. [2020-02-10 20:15:18,929 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:18,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:18,929 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3150 transitions. [2020-02-10 20:15:18,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3150 transitions. [2020-02-10 20:15:18,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:18,930 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:18,930 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:18,930 INFO L427 AbstractCegarLoop]: === Iteration 321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:18,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:18,931 INFO L82 PathProgramCache]: Analyzing trace with hash -68103471, now seen corresponding path program 314 times [2020-02-10 20:15:18,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:18,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611374406] [2020-02-10 20:15:18,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,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 20:15:19,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611374406] [2020-02-10 20:15:19,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:19,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036257764] [2020-02-10 20:15:19,338 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:19,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:19,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:19,339 INFO L87 Difference]: Start difference. First operand 790 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:19,531 INFO L93 Difference]: Finished difference Result 1385 states and 4881 transitions. [2020-02-10 20:15:19,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:19,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:19,535 INFO L225 Difference]: With dead ends: 1385 [2020-02-10 20:15:19,535 INFO L226 Difference]: Without dead ends: 1370 [2020-02-10 20:15:19,535 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:19,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2020-02-10 20:15:19,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 787. [2020-02-10 20:15:19,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:15:19,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3142 transitions. [2020-02-10 20:15:19,557 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3142 transitions. Word has length 25 [2020-02-10 20:15:19,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:19,558 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3142 transitions. [2020-02-10 20:15:19,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3142 transitions. [2020-02-10 20:15:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:19,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:19,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, 1, 1, 1] [2020-02-10 20:15:19,559 INFO L427 AbstractCegarLoop]: === Iteration 322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1491757329, now seen corresponding path program 315 times [2020-02-10 20:15:19,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:19,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225662451] [2020-02-10 20:15:19,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:19,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:19,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225662451] [2020-02-10 20:15:19,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:19,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:19,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128187164] [2020-02-10 20:15:19,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:19,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:19,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:19,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:19,959 INFO L87 Difference]: Start difference. First operand 787 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:15:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,105 INFO L93 Difference]: Finished difference Result 1389 states and 4890 transitions. [2020-02-10 20:15:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:20,105 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:20,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,108 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:15:20,108 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:15:20,109 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:20,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:15:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 791. [2020-02-10 20:15:20,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3149 transitions. [2020-02-10 20:15:20,130 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3149 transitions. Word has length 25 [2020-02-10 20:15:20,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,131 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3149 transitions. [2020-02-10 20:15:20,131 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3149 transitions. [2020-02-10 20:15:20,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:20,132 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,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, 1, 1, 1] [2020-02-10 20:15:20,132 INFO L427 AbstractCegarLoop]: === Iteration 323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,132 INFO L82 PathProgramCache]: Analyzing trace with hash -489996403, now seen corresponding path program 316 times [2020-02-10 20:15:20,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077294451] [2020-02-10 20:15:20,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:20,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 20:15:20,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077294451] [2020-02-10 20:15:20,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:20,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:20,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729669612] [2020-02-10 20:15:20,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:20,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:20,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:20,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:20,537 INFO L87 Difference]: Start difference. First operand 791 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:15:20,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:20,730 INFO L93 Difference]: Finished difference Result 1390 states and 4888 transitions. [2020-02-10 20:15:20,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:20,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:20,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:20,733 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:15:20,734 INFO L226 Difference]: Without dead ends: 1372 [2020-02-10 20:15:20,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:20,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1372 states. [2020-02-10 20:15:20,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1372 to 787. [2020-02-10 20:15:20,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:15:20,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3139 transitions. [2020-02-10 20:15:20,755 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3139 transitions. Word has length 25 [2020-02-10 20:15:20,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:20,756 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3139 transitions. [2020-02-10 20:15:20,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:20,756 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3139 transitions. [2020-02-10 20:15:20,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:20,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:20,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, 1, 1, 1] [2020-02-10 20:15:20,757 INFO L427 AbstractCegarLoop]: === Iteration 324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 921714163, now seen corresponding path program 317 times [2020-02-10 20:15:20,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:20,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814633318] [2020-02-10 20:15:20,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814633318] [2020-02-10 20:15:21,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:21,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597899097] [2020-02-10 20:15:21,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:21,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:21,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:21,158 INFO L87 Difference]: Start difference. First operand 787 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:15:21,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,341 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 20:15:21,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:21,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:21,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,345 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:15:21,345 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:15:21,345 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:21,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:15:21,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 20:15:21,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3144 transitions. [2020-02-10 20:15:21,371 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3144 transitions. Word has length 25 [2020-02-10 20:15:21,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,371 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3144 transitions. [2020-02-10 20:15:21,371 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:21,371 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3144 transitions. [2020-02-10 20:15:21,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:21,372 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,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, 1, 1, 1] [2020-02-10 20:15:21,372 INFO L427 AbstractCegarLoop]: === Iteration 325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash -151371217, now seen corresponding path program 318 times [2020-02-10 20:15:21,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185172300] [2020-02-10 20:15:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:21,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:21,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [185172300] [2020-02-10 20:15:21,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:21,770 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:21,770 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253569518] [2020-02-10 20:15:21,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:21,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:21,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:21,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:21,770 INFO L87 Difference]: Start difference. First operand 790 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:15:21,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:21,967 INFO L93 Difference]: Finished difference Result 1388 states and 4881 transitions. [2020-02-10 20:15:21,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:21,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:21,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:21,971 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:15:21,971 INFO L226 Difference]: Without dead ends: 1368 [2020-02-10 20:15:21,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:21,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2020-02-10 20:15:21,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 784. [2020-02-10 20:15:21,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:21,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3131 transitions. [2020-02-10 20:15:21,994 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3131 transitions. Word has length 25 [2020-02-10 20:15:21,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:21,994 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3131 transitions. [2020-02-10 20:15:21,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:21,994 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3131 transitions. [2020-02-10 20:15:21,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:21,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:21,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, 1, 1, 1] [2020-02-10 20:15:21,995 INFO L427 AbstractCegarLoop]: === Iteration 326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:21,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:21,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1471343915, now seen corresponding path program 319 times [2020-02-10 20:15:21,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:21,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341730297] [2020-02-10 20:15:21,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341730297] [2020-02-10 20:15:22,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:22,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242786143] [2020-02-10 20:15:22,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:22,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:22,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:22,419 INFO L87 Difference]: Start difference. First operand 784 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:15:22,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:22,570 INFO L93 Difference]: Finished difference Result 1393 states and 4897 transitions. [2020-02-10 20:15:22,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:22,570 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:22,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:22,574 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:15:22,574 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:15:22,575 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:22,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:15:22,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 791. [2020-02-10 20:15:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:22,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3150 transitions. [2020-02-10 20:15:22,597 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:22,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:22,597 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3150 transitions. [2020-02-10 20:15:22,597 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:22,597 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3150 transitions. [2020-02-10 20:15:22,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:22,598 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:22,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, 1, 1, 1] [2020-02-10 20:15:22,598 INFO L427 AbstractCegarLoop]: === Iteration 327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:22,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:22,599 INFO L82 PathProgramCache]: Analyzing trace with hash -490589197, now seen corresponding path program 320 times [2020-02-10 20:15:22,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:22,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329109689] [2020-02-10 20:15:22,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:22,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:22,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:22,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329109689] [2020-02-10 20:15:22,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:22,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:22,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218364504] [2020-02-10 20:15:22,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:22,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:22,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:22,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:22,996 INFO L87 Difference]: Start difference. First operand 791 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:23,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,188 INFO L93 Difference]: Finished difference Result 1392 states and 4892 transitions. [2020-02-10 20:15:23,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:23,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:23,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,192 INFO L225 Difference]: With dead ends: 1392 [2020-02-10 20:15:23,193 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:15:23,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:15:23,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 788. [2020-02-10 20:15:23,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:23,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3142 transitions. [2020-02-10 20:15:23,215 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3142 transitions. Word has length 25 [2020-02-10 20:15:23,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,215 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3142 transitions. [2020-02-10 20:15:23,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:23,216 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3142 transitions. [2020-02-10 20:15:23,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:23,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,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, 1, 1, 1] [2020-02-10 20:15:23,217 INFO L427 AbstractCegarLoop]: === Iteration 328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,217 INFO L82 PathProgramCache]: Analyzing trace with hash 11791023, now seen corresponding path program 321 times [2020-02-10 20:15:23,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991859883] [2020-02-10 20:15:23,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:23,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991859883] [2020-02-10 20:15:23,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:23,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:23,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011567582] [2020-02-10 20:15:23,644 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:23,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:23,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:23,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:23,644 INFO L87 Difference]: Start difference. First operand 788 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:15:23,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:23,792 INFO L93 Difference]: Finished difference Result 1401 states and 4910 transitions. [2020-02-10 20:15:23,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:23,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:23,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:23,795 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:15:23,795 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:15:23,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:23,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:15:23,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 793. [2020-02-10 20:15:23,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:23,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3151 transitions. [2020-02-10 20:15:23,817 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3151 transitions. Word has length 25 [2020-02-10 20:15:23,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:23,818 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3151 transitions. [2020-02-10 20:15:23,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:23,818 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3151 transitions. [2020-02-10 20:15:23,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:23,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:23,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, 1, 1, 1] [2020-02-10 20:15:23,819 INFO L427 AbstractCegarLoop]: === Iteration 329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:23,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:23,819 INFO L82 PathProgramCache]: Analyzing trace with hash 1024055053, now seen corresponding path program 322 times [2020-02-10 20:15:23,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:23,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335875436] [2020-02-10 20:15:23,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,218 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335875436] [2020-02-10 20:15:24,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,219 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:24,219 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315385023] [2020-02-10 20:15:24,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:24,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:24,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:24,220 INFO L87 Difference]: Start difference. First operand 793 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:15:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:24,387 INFO L93 Difference]: Finished difference Result 1406 states and 4915 transitions. [2020-02-10 20:15:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:24,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:24,391 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:15:24,391 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:15:24,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:15:24,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:15:24,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:24,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:15:24,414 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:15:24,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:24,414 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:15:24,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:24,414 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:15:24,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:24,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:24,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, 1, 1, 1] [2020-02-10 20:15:24,415 INFO L427 AbstractCegarLoop]: === Iteration 330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:24,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:24,415 INFO L82 PathProgramCache]: Analyzing trace with hash 824824661, now seen corresponding path program 323 times [2020-02-10 20:15:24,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:24,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608207784] [2020-02-10 20:15:24,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:24,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:24,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608207784] [2020-02-10 20:15:24,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:24,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:24,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312438803] [2020-02-10 20:15:24,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:24,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:24,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:24,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:24,809 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:15:25,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,000 INFO L93 Difference]: Finished difference Result 1398 states and 4899 transitions. [2020-02-10 20:15:25,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:25,001 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:25,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,004 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:15:25,004 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:15:25,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:25,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:15:25,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 20:15:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:25,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:15:25,026 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:15:25,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,027 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:15:25,027 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:15:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:25,028 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,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, 1, 1, 1] [2020-02-10 20:15:25,028 INFO L427 AbstractCegarLoop]: === Iteration 331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1362680239, now seen corresponding path program 324 times [2020-02-10 20:15:25,028 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,028 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631995956] [2020-02-10 20:15:25,028 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:25,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 20:15:25,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631995956] [2020-02-10 20:15:25,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:25,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:25,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369416341] [2020-02-10 20:15:25,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:25,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:25,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:25,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:25,428 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:15:25,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:25,594 INFO L93 Difference]: Finished difference Result 1404 states and 4907 transitions. [2020-02-10 20:15:25,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:25,594 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:25,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:25,598 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:15:25,598 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:15:25,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:25,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:15:25,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 784. [2020-02-10 20:15:25,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:25,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:15:25,620 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:15:25,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:25,620 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:15:25,620 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:25,620 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:15:25,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:25,621 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:25,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, 1, 1, 1] [2020-02-10 20:15:25,621 INFO L427 AbstractCegarLoop]: === Iteration 332 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:25,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1535752789, now seen corresponding path program 325 times [2020-02-10 20:15:25,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:25,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972321055] [2020-02-10 20:15:25,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:25,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972321055] [2020-02-10 20:15:26,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:26,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418310326] [2020-02-10 20:15:26,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:26,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:26,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:26,021 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:15:26,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,219 INFO L93 Difference]: Finished difference Result 1402 states and 4917 transitions. [2020-02-10 20:15:26,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:26,219 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:26,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,222 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:15:26,223 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:15:26,223 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:26,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:15:26,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 20:15:26,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:26,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:15:26,245 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:15:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,245 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:15:26,245 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:15:26,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:26,246 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,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, 1, 1, 1] [2020-02-10 20:15:26,246 INFO L427 AbstractCegarLoop]: === Iteration 333 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1757453581, now seen corresponding path program 326 times [2020-02-10 20:15:26,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825596719] [2020-02-10 20:15:26,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:26,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825596719] [2020-02-10 20:15:26,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:26,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:26,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657277208] [2020-02-10 20:15:26,663 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:26,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:26,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:26,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:26,663 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:15:26,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:26,798 INFO L93 Difference]: Finished difference Result 1403 states and 4915 transitions. [2020-02-10 20:15:26,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:26,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:26,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:26,803 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:15:26,803 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:15:26,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:26,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:15:26,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 789. [2020-02-10 20:15:26,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:26,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 20:15:26,826 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 20:15:26,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:26,826 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 20:15:26,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:26,826 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 20:15:26,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:26,827 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:26,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:26,827 INFO L427 AbstractCegarLoop]: === Iteration 334 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:26,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:26,827 INFO L82 PathProgramCache]: Analyzing trace with hash -833180429, now seen corresponding path program 327 times [2020-02-10 20:15:26,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:26,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392281281] [2020-02-10 20:15:26,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:26,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392281281] [2020-02-10 20:15:27,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:27,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499895857] [2020-02-10 20:15:27,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:27,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:27,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:27,221 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:15:27,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,356 INFO L93 Difference]: Finished difference Result 1407 states and 4922 transitions. [2020-02-10 20:15:27,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:27,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:27,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,360 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:15:27,361 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:15:27,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:27,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:15:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 794. [2020-02-10 20:15:27,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:27,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3150 transitions. [2020-02-10 20:15:27,383 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:27,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,383 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3150 transitions. [2020-02-10 20:15:27,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:27,383 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3150 transitions. [2020-02-10 20:15:27,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:27,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,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, 1, 1, 1] [2020-02-10 20:15:27,384 INFO L427 AbstractCegarLoop]: === Iteration 335 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,385 INFO L82 PathProgramCache]: Analyzing trace with hash 179083601, now seen corresponding path program 328 times [2020-02-10 20:15:27,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329612365] [2020-02-10 20:15:27,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:27,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:27,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329612365] [2020-02-10 20:15:27,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:27,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:27,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943310886] [2020-02-10 20:15:27,784 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:27,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:27,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:27,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:27,784 INFO L87 Difference]: Start difference. First operand 794 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:27,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:27,893 INFO L93 Difference]: Finished difference Result 1412 states and 4927 transitions. [2020-02-10 20:15:27,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:27,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:27,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:27,897 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:15:27,897 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:15:27,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:27,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:15:27,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 789. [2020-02-10 20:15:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:27,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 20:15:27,919 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 20:15:27,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:27,919 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 20:15:27,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:27,920 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 20:15:27,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:27,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:27,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, 1, 1, 1] [2020-02-10 20:15:27,921 INFO L427 AbstractCegarLoop]: === Iteration 336 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:27,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:27,921 INFO L82 PathProgramCache]: Analyzing trace with hash -442039723, now seen corresponding path program 329 times [2020-02-10 20:15:27,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:27,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724911128] [2020-02-10 20:15:27,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,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 20:15:28,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724911128] [2020-02-10 20:15:28,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:28,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399951694] [2020-02-10 20:15:28,319 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:28,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:28,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:28,319 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:15:28,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,448 INFO L93 Difference]: Finished difference Result 1410 states and 4924 transitions. [2020-02-10 20:15:28,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:28,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:28,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,452 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:15:28,453 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:15:28,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:28,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:15:28,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 795. [2020-02-10 20:15:28,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3147 transitions. [2020-02-10 20:15:28,475 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3147 transitions. Word has length 25 [2020-02-10 20:15:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:28,475 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3147 transitions. [2020-02-10 20:15:28,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3147 transitions. [2020-02-10 20:15:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:28,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:28,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, 1, 1, 1] [2020-02-10 20:15:28,476 INFO L427 AbstractCegarLoop]: === Iteration 337 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:28,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:28,476 INFO L82 PathProgramCache]: Analyzing trace with hash 1168901235, now seen corresponding path program 330 times [2020-02-10 20:15:28,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:28,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583772842] [2020-02-10 20:15:28,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:28,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:28,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:28,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583772842] [2020-02-10 20:15:28,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:28,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:28,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726744741] [2020-02-10 20:15:28,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:28,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:28,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:28,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:28,872 INFO L87 Difference]: Start difference. First operand 795 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:15:28,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:28,981 INFO L93 Difference]: Finished difference Result 1414 states and 4926 transitions. [2020-02-10 20:15:28,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:28,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:28,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:28,986 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:15:28,986 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:15:28,986 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:28,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:15:29,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 784. [2020-02-10 20:15:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:29,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 20:15:29,008 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 20:15:29,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,008 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 20:15:29,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:29,008 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 20:15:29,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:29,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,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, 1, 1, 1] [2020-02-10 20:15:29,010 INFO L427 AbstractCegarLoop]: === Iteration 338 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1250129199, now seen corresponding path program 331 times [2020-02-10 20:15:29,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026715807] [2020-02-10 20:15:29,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026715807] [2020-02-10 20:15:29,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:29,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259919276] [2020-02-10 20:15:29,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:29,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:29,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:29,403 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:15:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:29,536 INFO L93 Difference]: Finished difference Result 1395 states and 4894 transitions. [2020-02-10 20:15:29,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:29,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:29,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:29,540 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:15:29,540 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:15:29,540 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:29,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:15:29,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 20:15:29,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:29,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3142 transitions. [2020-02-10 20:15:29,562 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3142 transitions. Word has length 25 [2020-02-10 20:15:29,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:29,563 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3142 transitions. [2020-02-10 20:15:29,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:29,563 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3142 transitions. [2020-02-10 20:15:29,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:29,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:29,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, 1, 1, 1] [2020-02-10 20:15:29,564 INFO L427 AbstractCegarLoop]: === Iteration 339 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:29,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:29,564 INFO L82 PathProgramCache]: Analyzing trace with hash 1971752717, now seen corresponding path program 332 times [2020-02-10 20:15:29,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:29,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544233100] [2020-02-10 20:15:29,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:29,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:29,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:29,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544233100] [2020-02-10 20:15:29,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:29,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:29,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834918696] [2020-02-10 20:15:29,958 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:29,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:29,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:29,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:29,958 INFO L87 Difference]: Start difference. First operand 791 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:15:30,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,095 INFO L93 Difference]: Finished difference Result 1397 states and 4895 transitions. [2020-02-10 20:15:30,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:30,096 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:30,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,099 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:15:30,100 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:15:30,100 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:30,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:15:30,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 20:15:30,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:30,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:15:30,122 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:15:30,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,122 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:15:30,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:30,122 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:15:30,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:30,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,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, 1, 1, 1] [2020-02-10 20:15:30,136 INFO L427 AbstractCegarLoop]: === Iteration 340 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1444400243, now seen corresponding path program 333 times [2020-02-10 20:15:30,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12256703] [2020-02-10 20:15:30,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:30,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:30,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12256703] [2020-02-10 20:15:30,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:30,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:30,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890805661] [2020-02-10 20:15:30,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:30,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:30,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:30,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:30,525 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:15:30,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:30,661 INFO L93 Difference]: Finished difference Result 1400 states and 4900 transitions. [2020-02-10 20:15:30,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:30,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:30,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:30,664 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:15:30,664 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:15:30,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:15:30,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:15:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:30,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:15:30,687 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:15:30,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:30,687 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:15:30,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:30,687 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:15:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:30,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:30,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:30,688 INFO L427 AbstractCegarLoop]: === Iteration 341 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:30,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:30,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1982255821, now seen corresponding path program 334 times [2020-02-10 20:15:30,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:30,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548419662] [2020-02-10 20:15:30,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548419662] [2020-02-10 20:15:31,076 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,076 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:31,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992515549] [2020-02-10 20:15:31,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:31,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:31,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:31,076 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:15:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:31,179 INFO L93 Difference]: Finished difference Result 1406 states and 4908 transitions. [2020-02-10 20:15:31,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:31,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:31,184 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:15:31,184 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:15:31,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:15:31,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 788. [2020-02-10 20:15:31,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:31,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 20:15:31,206 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 20:15:31,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:31,206 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 20:15:31,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 20:15:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:31,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:31,208 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:31,208 INFO L427 AbstractCegarLoop]: === Iteration 342 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:31,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:31,208 INFO L82 PathProgramCache]: Analyzing trace with hash 1465406451, now seen corresponding path program 335 times [2020-02-10 20:15:31,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:31,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437214261] [2020-02-10 20:15:31,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:31,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437214261] [2020-02-10 20:15:31,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:31,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:31,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626295089] [2020-02-10 20:15:31,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:31,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:31,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:31,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:31,600 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:15:31,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:31,735 INFO L93 Difference]: Finished difference Result 1406 states and 4910 transitions. [2020-02-10 20:15:31,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:31,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:31,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:31,739 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:15:31,739 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:15:31,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:15:31,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 794. [2020-02-10 20:15:31,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:31,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 20:15:31,762 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 20:15:31,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:31,762 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 20:15:31,762 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:31,762 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 20:15:31,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:31,763 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15: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, 1, 1, 1] [2020-02-10 20:15:31,764 INFO L427 AbstractCegarLoop]: === Iteration 343 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:31,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1218619887, now seen corresponding path program 336 times [2020-02-10 20:15:31,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:31,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135406106] [2020-02-10 20:15:31,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135406106] [2020-02-10 20:15:32,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:32,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718475953] [2020-02-10 20:15:32,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:32,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:32,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:32,174 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:15:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,288 INFO L93 Difference]: Finished difference Result 1410 states and 4912 transitions. [2020-02-10 20:15:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:32,289 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:32,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,292 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:15:32,292 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:15:32,292 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:32,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:15:32,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 780. [2020-02-10 20:15:32,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:15:32,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:15:32,314 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:15:32,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,314 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:15:32,314 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:32,314 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:15:32,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:32,315 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:32,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, 1, 1, 1] [2020-02-10 20:15:32,316 INFO L427 AbstractCegarLoop]: === Iteration 344 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1832995017, now seen corresponding path program 337 times [2020-02-10 20:15:32,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963080732] [2020-02-10 20:15:32,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:32,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:32,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963080732] [2020-02-10 20:15:32,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:32,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:32,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577060481] [2020-02-10 20:15:32,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:32,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:32,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:32,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:32,709 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:15:32,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:32,842 INFO L93 Difference]: Finished difference Result 1399 states and 4914 transitions. [2020-02-10 20:15:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:32,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:32,845 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:15:32,846 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:15:32,846 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:32,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:15:32,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 790. [2020-02-10 20:15:32,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 20:15:32,868 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 20:15:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:32,868 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 20:15:32,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:32,868 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 20:15:32,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:32,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:32,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, 1, 1, 1] [2020-02-10 20:15:32,869 INFO L427 AbstractCegarLoop]: === Iteration 345 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:32,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:32,869 INFO L82 PathProgramCache]: Analyzing trace with hash -222054059, now seen corresponding path program 338 times [2020-02-10 20:15:32,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:32,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436881672] [2020-02-10 20:15:32,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436881672] [2020-02-10 20:15:33,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:33,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417184287] [2020-02-10 20:15:33,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:33,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:33,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:33,267 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:15:33,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,401 INFO L93 Difference]: Finished difference Result 1396 states and 4905 transitions. [2020-02-10 20:15:33,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:33,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:33,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,405 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:15:33,405 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:15:33,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:33,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:15:33,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 787. [2020-02-10 20:15:33,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:15:33,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:15:33,428 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:15:33,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,428 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:15:33,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:33,428 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:15:33,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:33,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,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, 1, 1, 1] [2020-02-10 20:15:33,429 INFO L427 AbstractCegarLoop]: === Iteration 346 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,430 INFO L82 PathProgramCache]: Analyzing trace with hash -738903429, now seen corresponding path program 339 times [2020-02-10 20:15:33,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256876302] [2020-02-10 20:15:33,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:33,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:33,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256876302] [2020-02-10 20:15:33,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:33,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:33,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70883406] [2020-02-10 20:15:33,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:33,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:33,825 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:15:33,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:33,955 INFO L93 Difference]: Finished difference Result 1403 states and 4921 transitions. [2020-02-10 20:15:33,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:33,955 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:33,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:33,958 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:15:33,958 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:15:33,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:33,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:15:33,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 792. [2020-02-10 20:15:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:33,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:15:33,980 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:15:33,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:33,980 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:15:33,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:15:33,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:33,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:33,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, 1, 1, 1] [2020-02-10 20:15:33,981 INFO L427 AbstractCegarLoop]: === Iteration 347 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:33,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:33,982 INFO L82 PathProgramCache]: Analyzing trace with hash -201047851, now seen corresponding path program 340 times [2020-02-10 20:15:33,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:33,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524660076] [2020-02-10 20:15:33,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:33,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:34,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:34,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524660076] [2020-02-10 20:15:34,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:34,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:34,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313771653] [2020-02-10 20:15:34,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:34,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:34,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:34,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:34,390 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:15:34,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:34,524 INFO L93 Difference]: Finished difference Result 1402 states and 4914 transitions. [2020-02-10 20:15:34,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:34,524 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:34,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:34,527 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:15:34,527 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:15:34,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:34,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:15:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 787. [2020-02-10 20:15:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:15:34,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 20:15:34,549 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 20:15:34,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:34,549 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 20:15:34,549 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:34,549 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 20:15:34,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:34,550 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:34,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, 1, 1, 1] [2020-02-10 20:15:34,551 INFO L427 AbstractCegarLoop]: === Iteration 348 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:34,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:34,551 INFO L82 PathProgramCache]: Analyzing trace with hash -728400325, now seen corresponding path program 341 times [2020-02-10 20:15:34,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:34,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844468691] [2020-02-10 20:15:34,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:34,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:34,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:34,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844468691] [2020-02-10 20:15:34,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:34,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:34,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637107915] [2020-02-10 20:15:34,935 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:34,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:34,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:34,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:34,936 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:15:35,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:35,064 INFO L93 Difference]: Finished difference Result 1395 states and 4900 transitions. [2020-02-10 20:15:35,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:35,064 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:35,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:35,067 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:15:35,067 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:15:35,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:15:35,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 790. [2020-02-10 20:15:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:15:35,090 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:15:35,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:35,090 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:15:35,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:35,090 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:15:35,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:35,091 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:35,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, 1, 1, 1] [2020-02-10 20:15:35,091 INFO L427 AbstractCegarLoop]: === Iteration 349 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:35,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1801485705, now seen corresponding path program 342 times [2020-02-10 20:15:35,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:35,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113718420] [2020-02-10 20:15:35,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:35,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:35,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 20:15:35,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113718420] [2020-02-10 20:15:35,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:35,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:35,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [601702334] [2020-02-10 20:15:35,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:35,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:35,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:35,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:35,487 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:15:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:35,632 INFO L93 Difference]: Finished difference Result 1397 states and 4901 transitions. [2020-02-10 20:15:35,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:35,632 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:35,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:35,635 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:15:35,636 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:15:35,636 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:35,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:15:35,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 784. [2020-02-10 20:15:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:15:35,658 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:15:35,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:35,658 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:15:35,658 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:35,658 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:15:35,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:35,659 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:35,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, 1, 1, 1] [2020-02-10 20:15:35,659 INFO L427 AbstractCegarLoop]: === Iteration 350 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:35,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:35,659 INFO L82 PathProgramCache]: Analyzing trace with hash 93039061, now seen corresponding path program 343 times [2020-02-10 20:15:35,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:35,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133676437] [2020-02-10 20:15:35,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:35,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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 20:15:36,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133676437] [2020-02-10 20:15:36,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:36,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664939238] [2020-02-10 20:15:36,048 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:36,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:36,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:36,049 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:15:36,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,190 INFO L93 Difference]: Finished difference Result 1407 states and 4928 transitions. [2020-02-10 20:15:36,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:36,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:36,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,193 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:15:36,194 INFO L226 Difference]: Without dead ends: 1392 [2020-02-10 20:15:36,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:36,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1392 states. [2020-02-10 20:15:36,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1392 to 791. [2020-02-10 20:15:36,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3146 transitions. [2020-02-10 20:15:36,216 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3146 transitions. Word has length 25 [2020-02-10 20:15:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,216 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3146 transitions. [2020-02-10 20:15:36,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3146 transitions. [2020-02-10 20:15:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:36,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,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, 1, 1, 1] [2020-02-10 20:15:36,217 INFO L427 AbstractCegarLoop]: === Iteration 351 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1703980019, now seen corresponding path program 344 times [2020-02-10 20:15:36,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882894409] [2020-02-10 20:15:36,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:36,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882894409] [2020-02-10 20:15:36,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:36,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:36,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670790352] [2020-02-10 20:15:36,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:36,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:36,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:36,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:36,608 INFO L87 Difference]: Start difference. First operand 791 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:15:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:36,737 INFO L93 Difference]: Finished difference Result 1404 states and 4919 transitions. [2020-02-10 20:15:36,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:36,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:36,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:36,741 INFO L225 Difference]: With dead ends: 1404 [2020-02-10 20:15:36,742 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:15:36,742 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:36,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:15:36,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 788. [2020-02-10 20:15:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:15:36,765 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:15:36,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:36,765 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:15:36,765 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:36,765 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:15:36,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:36,766 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:36,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, 1, 1, 1] [2020-02-10 20:15:36,766 INFO L427 AbstractCegarLoop]: === Iteration 352 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:36,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:36,767 INFO L82 PathProgramCache]: Analyzing trace with hash -413307205, now seen corresponding path program 345 times [2020-02-10 20:15:36,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:36,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767741451] [2020-02-10 20:15:36,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767741451] [2020-02-10 20:15:37,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:37,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380751087] [2020-02-10 20:15:37,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:37,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:37,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:37,156 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:15:37,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,292 INFO L93 Difference]: Finished difference Result 1417 states and 4947 transitions. [2020-02-10 20:15:37,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:37,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:37,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,296 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:15:37,296 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:15:37,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:37,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:15:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 20:15:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:37,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:15:37,319 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:15:37,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,319 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:15:37,319 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:15:37,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:37,320 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,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, 1, 1, 1] [2020-02-10 20:15:37,321 INFO L427 AbstractCegarLoop]: === Iteration 353 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1735489331, now seen corresponding path program 346 times [2020-02-10 20:15:37,321 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685301704] [2020-02-10 20:15:37,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:37,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685301704] [2020-02-10 20:15:37,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:37,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:37,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119798312] [2020-02-10 20:15:37,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:37,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:37,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:37,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:37,730 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:15:37,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:37,836 INFO L93 Difference]: Finished difference Result 1420 states and 4946 transitions. [2020-02-10 20:15:37,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:37,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:37,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:37,841 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:15:37,841 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:15:37,841 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:37,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:15:37,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 788. [2020-02-10 20:15:37,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:37,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:15:37,863 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:15:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:37,863 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:15:37,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:15:37,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:37,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:37,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, 1, 1, 1] [2020-02-10 20:15:37,865 INFO L427 AbstractCegarLoop]: === Iteration 354 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:37,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:37,865 INFO L82 PathProgramCache]: Analyzing trace with hash -402804101, now seen corresponding path program 347 times [2020-02-10 20:15:37,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:37,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891791984] [2020-02-10 20:15:37,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:37,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:38,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:38,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891791984] [2020-02-10 20:15:38,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:38,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:38,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851302836] [2020-02-10 20:15:38,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:38,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:38,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:38,274 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:15:38,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,405 INFO L93 Difference]: Finished difference Result 1408 states and 4922 transitions. [2020-02-10 20:15:38,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:38,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:38,408 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:15:38,409 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:15:38,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:38,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:15:38,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:15:38,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:38,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:15:38,431 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:15:38,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:38,431 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:15:38,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:38,431 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:15:38,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:38,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:38,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, 1, 1, 1] [2020-02-10 20:15:38,432 INFO L427 AbstractCegarLoop]: === Iteration 355 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:38,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:38,432 INFO L82 PathProgramCache]: Analyzing trace with hash 135051477, now seen corresponding path program 348 times [2020-02-10 20:15:38,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:38,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735462537] [2020-02-10 20:15:38,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:38,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:38,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735462537] [2020-02-10 20:15:38,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:38,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:38,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214692940] [2020-02-10 20:15:38,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:38,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:38,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:38,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:38,864 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:15:38,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:38,996 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 20:15:38,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:38,997 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:38,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,001 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:15:39,001 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:15:39,001 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:39,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:15:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 784. [2020-02-10 20:15:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:39,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3123 transitions. [2020-02-10 20:15:39,023 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3123 transitions. Word has length 25 [2020-02-10 20:15:39,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,023 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3123 transitions. [2020-02-10 20:15:39,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:39,023 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3123 transitions. [2020-02-10 20:15:39,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:39,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,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, 1, 1, 1] [2020-02-10 20:15:39,025 INFO L427 AbstractCegarLoop]: === Iteration 356 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,025 INFO L82 PathProgramCache]: Analyzing trace with hash 744231509, now seen corresponding path program 349 times [2020-02-10 20:15:39,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894307360] [2020-02-10 20:15:39,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:39,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 20:15:39,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894307360] [2020-02-10 20:15:39,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:39,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:39,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990564711] [2020-02-10 20:15:39,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:39,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:39,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:39,436 INFO L87 Difference]: Start difference. First operand 784 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:15:39,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:39,582 INFO L93 Difference]: Finished difference Result 1419 states and 4958 transitions. [2020-02-10 20:15:39,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:39,582 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:39,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:39,586 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:15:39,586 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:15:39,586 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:39,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:15:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 20:15:39,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:15:39,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 20:15:39,609 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 20:15:39,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:39,609 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 20:15:39,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:39,609 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 20:15:39,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:39,610 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:39,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, 1, 1, 1] [2020-02-10 20:15:39,611 INFO L427 AbstractCegarLoop]: === Iteration 357 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:39,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:39,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1282087087, now seen corresponding path program 350 times [2020-02-10 20:15:39,611 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:39,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131074128] [2020-02-10 20:15:39,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:40,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:40,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131074128] [2020-02-10 20:15:40,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:40,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:40,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745791805] [2020-02-10 20:15:40,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:40,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:40,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:40,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:40,013 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:15:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,189 INFO L93 Difference]: Finished difference Result 1418 states and 4951 transitions. [2020-02-10 20:15:40,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:40,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:40,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,193 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:15:40,193 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:15:40,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:15:40,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:15:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:15:40,216 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:15:40,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:40,216 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:15:40,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:40,216 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:15:40,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:40,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:40,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, 1, 1, 1] [2020-02-10 20:15:40,217 INFO L427 AbstractCegarLoop]: === Iteration 358 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash -856206345, now seen corresponding path program 351 times [2020-02-10 20:15:40,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:40,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8239986] [2020-02-10 20:15:40,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:40,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:40,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:40,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8239986] [2020-02-10 20:15:40,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:40,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:40,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761166843] [2020-02-10 20:15:40,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:40,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:40,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:40,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:40,618 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:15:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:40,772 INFO L93 Difference]: Finished difference Result 1425 states and 4965 transitions. [2020-02-10 20:15:40,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:40,772 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:40,776 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:15:40,776 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:15:40,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:40,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:15:40,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 797. [2020-02-10 20:15:40,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:40,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3153 transitions. [2020-02-10 20:15:40,798 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3153 transitions. Word has length 25 [2020-02-10 20:15:40,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:40,798 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3153 transitions. [2020-02-10 20:15:40,799 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:40,799 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3153 transitions. [2020-02-10 20:15:40,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:40,800 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:40,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, 1, 1, 1] [2020-02-10 20:15:40,800 INFO L427 AbstractCegarLoop]: === Iteration 359 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:40,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:40,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1292590191, now seen corresponding path program 352 times [2020-02-10 20:15:40,800 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:40,800 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971058490] [2020-02-10 20:15:40,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:41,207 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971058490] [2020-02-10 20:15:41,207 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:41,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601329916] [2020-02-10 20:15:41,207 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:41,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:41,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:41,208 INFO L87 Difference]: Start difference. First operand 797 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:15:41,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,326 INFO L93 Difference]: Finished difference Result 1428 states and 4964 transitions. [2020-02-10 20:15:41,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:41,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:41,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,329 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:15:41,330 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:15:41,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:41,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:15:41,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 790. [2020-02-10 20:15:41,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:15:41,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3134 transitions. [2020-02-10 20:15:41,352 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3134 transitions. Word has length 25 [2020-02-10 20:15:41,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,352 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3134 transitions. [2020-02-10 20:15:41,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:41,352 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3134 transitions. [2020-02-10 20:15:41,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:41,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,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, 1, 1, 1] [2020-02-10 20:15:41,353 INFO L427 AbstractCegarLoop]: === Iteration 360 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,353 INFO L82 PathProgramCache]: Analyzing trace with hash -824697033, now seen corresponding path program 353 times [2020-02-10 20:15:41,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557109478] [2020-02-10 20:15:41,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:41,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 20:15:41,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557109478] [2020-02-10 20:15:41,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:41,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:41,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902326335] [2020-02-10 20:15:41,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:41,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:41,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:41,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:41,755 INFO L87 Difference]: Start difference. First operand 790 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:15:41,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:41,891 INFO L93 Difference]: Finished difference Result 1422 states and 4952 transitions. [2020-02-10 20:15:41,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:41,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:41,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:41,895 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:15:41,895 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:15:41,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:41,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:15:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 796. [2020-02-10 20:15:41,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:15:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 20:15:41,920 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 20:15:41,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:41,920 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 20:15:41,920 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:41,920 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 20:15:41,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:41,921 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:41,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, 1, 1, 1] [2020-02-10 20:15:41,921 INFO L427 AbstractCegarLoop]: === Iteration 361 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:41,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:41,921 INFO L82 PathProgramCache]: Analyzing trace with hash 786243925, now seen corresponding path program 354 times [2020-02-10 20:15:41,922 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:41,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307634877] [2020-02-10 20:15:41,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:41,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307634877] [2020-02-10 20:15:42,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:42,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128720016] [2020-02-10 20:15:42,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:42,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:42,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:42,344 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:15:42,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:42,455 INFO L93 Difference]: Finished difference Result 1426 states and 4954 transitions. [2020-02-10 20:15:42,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:42,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:42,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:42,460 INFO L225 Difference]: With dead ends: 1426 [2020-02-10 20:15:42,460 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:15:42,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:15:42,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 784. [2020-02-10 20:15:42,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:15:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:15:42,482 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:15:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:42,482 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:15:42,482 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:15:42,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:42,483 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:42,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, 1, 1, 1] [2020-02-10 20:15:42,483 INFO L427 AbstractCegarLoop]: === Iteration 362 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:42,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:42,484 INFO L82 PathProgramCache]: Analyzing trace with hash -1614198605, now seen corresponding path program 355 times [2020-02-10 20:15:42,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:42,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659366490] [2020-02-10 20:15:42,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:42,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:42,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659366490] [2020-02-10 20:15:42,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:42,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:42,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780906723] [2020-02-10 20:15:42,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:42,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:42,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:42,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:42,867 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:15:43,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,008 INFO L93 Difference]: Finished difference Result 1401 states and 4907 transitions. [2020-02-10 20:15:43,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:43,008 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:43,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,011 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:15:43,012 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:15:43,012 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:15:43,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 791. [2020-02-10 20:15:43,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:15:43,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 20:15:43,034 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 20:15:43,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,034 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 20:15:43,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 20:15:43,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:43,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,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, 1, 1, 1] [2020-02-10 20:15:43,036 INFO L427 AbstractCegarLoop]: === Iteration 363 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1607683311, now seen corresponding path program 356 times [2020-02-10 20:15:43,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,036 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764889357] [2020-02-10 20:15:43,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:43,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764889357] [2020-02-10 20:15:43,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:43,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:43,433 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693356163] [2020-02-10 20:15:43,433 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:43,433 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:43,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:43,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:43,433 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:15:43,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:43,567 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 20:15:43,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:43,568 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:43,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:43,571 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:15:43,572 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:15:43,572 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:43,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:15:43,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 788. [2020-02-10 20:15:43,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:43,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3130 transitions. [2020-02-10 20:15:43,594 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3130 transitions. Word has length 25 [2020-02-10 20:15:43,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:43,594 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3130 transitions. [2020-02-10 20:15:43,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3130 transitions. [2020-02-10 20:15:43,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:43,595 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:43,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, 1, 1, 1] [2020-02-10 20:15:43,595 INFO L427 AbstractCegarLoop]: === Iteration 364 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:43,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:43,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1080330837, now seen corresponding path program 357 times [2020-02-10 20:15:43,596 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:43,596 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126070134] [2020-02-10 20:15:43,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:43,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:43,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126070134] [2020-02-10 20:15:43,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:43,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:43,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738894106] [2020-02-10 20:15:43,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:43,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:43,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:43,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:43,981 INFO L87 Difference]: Start difference. First operand 788 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:15:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,119 INFO L93 Difference]: Finished difference Result 1406 states and 4913 transitions. [2020-02-10 20:15:44,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:44,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,123 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:15:44,123 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:15:44,123 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:44,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:15:44,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 792. [2020-02-10 20:15:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:15:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:15:44,145 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:15:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:44,145 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:15:44,146 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:15:44,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:44,147 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:44,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, 1, 1, 1] [2020-02-10 20:15:44,147 INFO L427 AbstractCegarLoop]: === Iteration 365 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:44,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:44,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1618186415, now seen corresponding path program 358 times [2020-02-10 20:15:44,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:44,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441278974] [2020-02-10 20:15:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:44,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:44,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 20:15:44,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441278974] [2020-02-10 20:15:44,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:44,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:44,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40007090] [2020-02-10 20:15:44,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:44,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:44,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:44,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:44,535 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:15:44,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:44,669 INFO L93 Difference]: Finished difference Result 1412 states and 4921 transitions. [2020-02-10 20:15:44,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:44,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:44,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:44,673 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:15:44,674 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:15:44,674 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:44,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:15:44,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 788. [2020-02-10 20:15:44,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:15:44,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3126 transitions. [2020-02-10 20:15:44,696 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3126 transitions. Word has length 25 [2020-02-10 20:15:44,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:44,696 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3126 transitions. [2020-02-10 20:15:44,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:44,696 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3126 transitions. [2020-02-10 20:15:44,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:44,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:44,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, 1, 1, 1] [2020-02-10 20:15:44,697 INFO L427 AbstractCegarLoop]: === Iteration 366 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:44,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:44,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1101337045, now seen corresponding path program 359 times [2020-02-10 20:15:44,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:44,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476053938] [2020-02-10 20:15:44,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:45,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:45,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476053938] [2020-02-10 20:15:45,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:45,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:45,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957886056] [2020-02-10 20:15:45,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:45,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:45,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:45,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:45,092 INFO L87 Difference]: Start difference. First operand 788 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:15:45,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,232 INFO L93 Difference]: Finished difference Result 1412 states and 4923 transitions. [2020-02-10 20:15:45,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:45,233 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:45,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,237 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:15:45,237 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:15:45,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:45,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:15:45,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:15:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:15:45,259 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:15:45,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,260 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:15:45,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:45,260 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:15:45,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:45,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,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, 1, 1, 1] [2020-02-10 20:15:45,261 INFO L427 AbstractCegarLoop]: === Iteration 367 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1582689293, now seen corresponding path program 360 times [2020-02-10 20:15:45,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [410698965] [2020-02-10 20:15:45,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:45,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:45,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [410698965] [2020-02-10 20:15:45,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:45,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:45,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190305986] [2020-02-10 20:15:45,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:45,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:45,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:45,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:45,667 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:15:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:45,780 INFO L93 Difference]: Finished difference Result 1416 states and 4925 transitions. [2020-02-10 20:15:45,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:45,780 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:45,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:45,784 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:15:45,784 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:15:45,784 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:45,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:15:45,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 776. [2020-02-10 20:15:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:15:45,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3101 transitions. [2020-02-10 20:15:45,806 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3101 transitions. Word has length 25 [2020-02-10 20:15:45,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:45,807 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3101 transitions. [2020-02-10 20:15:45,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3101 transitions. [2020-02-10 20:15:45,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:45,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:45,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, 1, 1, 1] [2020-02-10 20:15:45,808 INFO L427 AbstractCegarLoop]: === Iteration 368 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:45,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:45,808 INFO L82 PathProgramCache]: Analyzing trace with hash 519656473, now seen corresponding path program 361 times [2020-02-10 20:15:45,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:45,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688622282] [2020-02-10 20:15:45,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688622282] [2020-02-10 20:15:46,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:46,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496055877] [2020-02-10 20:15:46,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:46,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:46,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:46,225 INFO L87 Difference]: Start difference. First operand 776 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:15:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,386 INFO L93 Difference]: Finished difference Result 1450 states and 5092 transitions. [2020-02-10 20:15:46,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:46,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,390 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:15:46,391 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:15:46,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:46,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:15:46,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 20:15:46,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:46,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3180 transitions. [2020-02-10 20:15:46,414 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3180 transitions. Word has length 25 [2020-02-10 20:15:46,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:46,414 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3180 transitions. [2020-02-10 20:15:46,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:46,414 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3180 transitions. [2020-02-10 20:15:46,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:46,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:46,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, 1, 1, 1] [2020-02-10 20:15:46,415 INFO L427 AbstractCegarLoop]: === Iteration 369 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:46,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:46,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1489908087, now seen corresponding path program 362 times [2020-02-10 20:15:46,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:46,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132396011] [2020-02-10 20:15:46,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:46,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:46,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132396011] [2020-02-10 20:15:46,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:46,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:46,828 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200399226] [2020-02-10 20:15:46,828 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:46,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:46,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:46,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:46,828 INFO L87 Difference]: Start difference. First operand 797 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:15:46,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:46,990 INFO L93 Difference]: Finished difference Result 1452 states and 5092 transitions. [2020-02-10 20:15:46,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:46,991 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:46,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:46,994 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:15:46,994 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:15:46,995 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:47,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:15:47,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 793. [2020-02-10 20:15:47,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:47,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3169 transitions. [2020-02-10 20:15:47,017 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3169 transitions. Word has length 25 [2020-02-10 20:15:47,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:47,017 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3169 transitions. [2020-02-10 20:15:47,017 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:47,017 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3169 transitions. [2020-02-10 20:15:47,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:47,018 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:47,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, 1, 1, 1] [2020-02-10 20:15:47,019 INFO L427 AbstractCegarLoop]: === Iteration 370 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:47,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:47,019 INFO L82 PathProgramCache]: Analyzing trace with hash 76757333, now seen corresponding path program 363 times [2020-02-10 20:15:47,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:47,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134373167] [2020-02-10 20:15:47,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:47,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:47,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134373167] [2020-02-10 20:15:47,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:47,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:47,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454836872] [2020-02-10 20:15:47,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:47,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:47,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:47,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:47,452 INFO L87 Difference]: Start difference. First operand 793 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:15:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:47,585 INFO L93 Difference]: Finished difference Result 1451 states and 5090 transitions. [2020-02-10 20:15:47,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:47,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:47,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:47,589 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:15:47,589 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:15:47,590 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:47,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:15:47,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 797. [2020-02-10 20:15:47,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:47,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 20:15:47,612 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 20:15:47,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:47,612 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 20:15:47,612 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:47,612 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 20:15:47,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:47,613 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:47,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, 1, 1, 1] [2020-02-10 20:15:47,614 INFO L427 AbstractCegarLoop]: === Iteration 371 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:47,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:47,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1068015155, now seen corresponding path program 364 times [2020-02-10 20:15:47,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:47,614 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496689796] [2020-02-10 20:15:47,614 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:47,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496689796] [2020-02-10 20:15:48,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:48,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316642156] [2020-02-10 20:15:48,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:48,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:48,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:48,022 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:15:48,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,158 INFO L93 Difference]: Finished difference Result 1454 states and 5092 transitions. [2020-02-10 20:15:48,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:48,158 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:48,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,162 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:15:48,162 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:15:48,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:48,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:15:48,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 793. [2020-02-10 20:15:48,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:48,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:15:48,185 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:15:48,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,185 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:15:48,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:48,185 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:15:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:48,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,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, 1, 1, 1] [2020-02-10 20:15:48,186 INFO L427 AbstractCegarLoop]: === Iteration 372 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2140837799, now seen corresponding path program 365 times [2020-02-10 20:15:48,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155144585] [2020-02-10 20:15:48,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:48,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:48,593 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155144585] [2020-02-10 20:15:48,593 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:48,593 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:48,593 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82953019] [2020-02-10 20:15:48,593 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:48,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:48,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:48,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:48,594 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:15:48,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:48,729 INFO L93 Difference]: Finished difference Result 1457 states and 5100 transitions. [2020-02-10 20:15:48,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:48,730 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:48,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:48,733 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:15:48,733 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:15:48,734 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:48,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:15:48,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 799. [2020-02-10 20:15:48,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:15:48,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3176 transitions. [2020-02-10 20:15:48,756 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3176 transitions. Word has length 25 [2020-02-10 20:15:48,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:48,756 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3176 transitions. [2020-02-10 20:15:48,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:48,756 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3176 transitions. [2020-02-10 20:15:48,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:48,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:48,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, 1, 1, 1] [2020-02-10 20:15:48,757 INFO L427 AbstractCegarLoop]: === Iteration 373 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:48,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:48,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1081044117, now seen corresponding path program 366 times [2020-02-10 20:15:48,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:48,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458006141] [2020-02-10 20:15:48,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:48,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458006141] [2020-02-10 20:15:49,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:49,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790950523] [2020-02-10 20:15:49,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:49,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:49,165 INFO L87 Difference]: Start difference. First operand 799 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:15:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,306 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:15:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:49,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,310 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:15:49,310 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:15:49,311 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:49,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:15:49,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 789. [2020-02-10 20:15:49,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:49,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3154 transitions. [2020-02-10 20:15:49,333 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3154 transitions. Word has length 25 [2020-02-10 20:15:49,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,333 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3154 transitions. [2020-02-10 20:15:49,333 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:49,333 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3154 transitions. [2020-02-10 20:15:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:49,334 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,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, 1, 1, 1] [2020-02-10 20:15:49,334 INFO L427 AbstractCegarLoop]: === Iteration 374 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash 97170747, now seen corresponding path program 367 times [2020-02-10 20:15:49,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28496776] [2020-02-10 20:15:49,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:49,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:49,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28496776] [2020-02-10 20:15:49,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:49,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:49,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122080713] [2020-02-10 20:15:49,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:49,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:49,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:49,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:49,737 INFO L87 Difference]: Start difference. First operand 789 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:15:49,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:49,875 INFO L93 Difference]: Finished difference Result 1447 states and 5081 transitions. [2020-02-10 20:15:49,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:49,876 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:49,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:49,879 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:15:49,879 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:15:49,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:49,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:15:49,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:15:49,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:49,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3176 transitions. [2020-02-10 20:15:49,902 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3176 transitions. Word has length 25 [2020-02-10 20:15:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:49,902 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3176 transitions. [2020-02-10 20:15:49,902 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3176 transitions. [2020-02-10 20:15:49,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:49,903 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:49,903 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:49,903 INFO L427 AbstractCegarLoop]: === Iteration 375 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:49,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1067422361, now seen corresponding path program 368 times [2020-02-10 20:15:49,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:49,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067583998] [2020-02-10 20:15:49,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:49,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:50,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:50,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067583998] [2020-02-10 20:15:50,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:50,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:50,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793339889] [2020-02-10 20:15:50,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:50,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:50,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:50,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:50,317 INFO L87 Difference]: Start difference. First operand 797 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:15:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:50,452 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 20:15:50,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:50,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:50,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:50,456 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:15:50,456 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:15:50,457 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:50,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:15:50,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:15:50,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:50,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3165 transitions. [2020-02-10 20:15:50,479 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3165 transitions. Word has length 25 [2020-02-10 20:15:50,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:50,479 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3165 transitions. [2020-02-10 20:15:50,479 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3165 transitions. [2020-02-10 20:15:50,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:50,480 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:50,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, 1, 1, 1] [2020-02-10 20:15:50,480 INFO L427 AbstractCegarLoop]: === Iteration 376 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:50,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:50,480 INFO L82 PathProgramCache]: Analyzing trace with hash 1580305685, now seen corresponding path program 369 times [2020-02-10 20:15:50,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:50,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294402323] [2020-02-10 20:15:50,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:50,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:50,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:50,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294402323] [2020-02-10 20:15:50,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:50,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:50,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922005835] [2020-02-10 20:15:50,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:50,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:50,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:50,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:50,883 INFO L87 Difference]: Start difference. First operand 793 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:15:51,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:51,038 INFO L93 Difference]: Finished difference Result 1446 states and 5075 transitions. [2020-02-10 20:15:51,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:51,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:51,042 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:15:51,042 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:15:51,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:51,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:15:51,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 797. [2020-02-10 20:15:51,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:51,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 20:15:51,065 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 20:15:51,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:51,065 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 20:15:51,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 20:15:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:51,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:51,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, 1, 1, 1] [2020-02-10 20:15:51,067 INFO L427 AbstractCegarLoop]: === Iteration 377 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:51,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:51,067 INFO L82 PathProgramCache]: Analyzing trace with hash -1712900685, now seen corresponding path program 370 times [2020-02-10 20:15:51,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:51,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169133438] [2020-02-10 20:15:51,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:51,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:51,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:51,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169133438] [2020-02-10 20:15:51,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:51,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:51,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406945771] [2020-02-10 20:15:51,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:51,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:51,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:51,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:51,472 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:15:51,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:51,610 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 20:15:51,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:51,610 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:51,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:51,614 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:15:51,614 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:15:51,614 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:51,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:15:51,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 20:15:51,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:51,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:15:51,637 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:15:51,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:51,637 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:15:51,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:51,637 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:15:51,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:51,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:51,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, 1, 1, 1] [2020-02-10 20:15:51,638 INFO L427 AbstractCegarLoop]: === Iteration 378 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:51,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:51,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2057239995, now seen corresponding path program 371 times [2020-02-10 20:15:51,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:51,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937765624] [2020-02-10 20:15:51,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:51,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15: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 20:15:52,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937765624] [2020-02-10 20:15:52,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:52,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:52,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925191473] [2020-02-10 20:15:52,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:52,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:52,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:52,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:52,054 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:15:52,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,202 INFO L93 Difference]: Finished difference Result 1451 states and 5082 transitions. [2020-02-10 20:15:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:52,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:52,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,206 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:15:52,206 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:15:52,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:15:52,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 798. [2020-02-10 20:15:52,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:15:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 20:15:52,228 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 20:15:52,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,228 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 20:15:52,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:52,228 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 20:15:52,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:52,229 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,229 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:52,229 INFO L427 AbstractCegarLoop]: === Iteration 379 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1699871723, now seen corresponding path program 372 times [2020-02-10 20:15:52,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705024758] [2020-02-10 20:15:52,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:52,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:52,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705024758] [2020-02-10 20:15:52,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:52,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:52,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967261158] [2020-02-10 20:15:52,635 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:52,635 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:52,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:52,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:52,635 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:15:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:52,777 INFO L93 Difference]: Finished difference Result 1450 states and 5075 transitions. [2020-02-10 20:15:52,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:52,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:52,781 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:15:52,781 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:15:52,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:52,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:15:52,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 789. [2020-02-10 20:15:52,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:52,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3150 transitions. [2020-02-10 20:15:52,804 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3150 transitions. Word has length 25 [2020-02-10 20:15:52,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:52,804 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3150 transitions. [2020-02-10 20:15:52,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:52,804 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3150 transitions. [2020-02-10 20:15:52,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:52,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:52,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, 1, 1, 1] [2020-02-10 20:15:52,805 INFO L427 AbstractCegarLoop]: === Iteration 380 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:52,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:52,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1190699845, now seen corresponding path program 373 times [2020-02-10 20:15:52,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:52,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802506415] [2020-02-10 20:15:52,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802506415] [2020-02-10 20:15:53,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:53,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234339696] [2020-02-10 20:15:53,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:53,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:53,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:53,211 INFO L87 Difference]: Start difference. First operand 789 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:15:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:53,350 INFO L93 Difference]: Finished difference Result 1449 states and 5081 transitions. [2020-02-10 20:15:53,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:53,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:53,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:53,354 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:15:53,354 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:15:53,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:53,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:15:53,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 20:15:53,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:53,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3172 transitions. [2020-02-10 20:15:53,377 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3172 transitions. Word has length 25 [2020-02-10 20:15:53,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:53,377 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3172 transitions. [2020-02-10 20:15:53,377 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:53,377 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3172 transitions. [2020-02-10 20:15:53,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:53,378 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:53,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, 1, 1, 1] [2020-02-10 20:15:53,378 INFO L427 AbstractCegarLoop]: === Iteration 381 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:53,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:53,378 INFO L82 PathProgramCache]: Analyzing trace with hash -199442023, now seen corresponding path program 374 times [2020-02-10 20:15:53,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:53,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065651003] [2020-02-10 20:15:53,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:53,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:53,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:53,779 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065651003] [2020-02-10 20:15:53,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:53,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:53,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503443877] [2020-02-10 20:15:53,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:53,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:53,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:53,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:53,780 INFO L87 Difference]: Start difference. First operand 797 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:15:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:53,931 INFO L93 Difference]: Finished difference Result 1452 states and 5083 transitions. [2020-02-10 20:15:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:53,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:53,935 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:15:53,936 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:15:53,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:53,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:15:53,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 793. [2020-02-10 20:15:53,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:53,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3161 transitions. [2020-02-10 20:15:53,958 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3161 transitions. Word has length 25 [2020-02-10 20:15:53,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:53,959 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3161 transitions. [2020-02-10 20:15:53,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3161 transitions. [2020-02-10 20:15:53,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:53,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:53,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, 1, 1, 1] [2020-02-10 20:15:53,960 INFO L427 AbstractCegarLoop]: === Iteration 382 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash 735334233, now seen corresponding path program 375 times [2020-02-10 20:15:53,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:53,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197946358] [2020-02-10 20:15:53,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:54,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:54,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197946358] [2020-02-10 20:15:54,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:54,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:54,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308341027] [2020-02-10 20:15:54,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:54,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:54,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:54,383 INFO L87 Difference]: Start difference. First operand 793 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:15:54,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:54,510 INFO L93 Difference]: Finished difference Result 1447 states and 5073 transitions. [2020-02-10 20:15:54,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:54,511 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:54,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:54,515 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:15:54,515 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:15:54,515 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:54,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:15:54,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:15:54,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:15:54,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:15:54,537 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:15:54,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:54,537 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:15:54,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:54,538 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:15:54,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:54,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:54,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, 1, 1, 1] [2020-02-10 20:15:54,539 INFO L427 AbstractCegarLoop]: === Iteration 383 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:54,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:54,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1737095159, now seen corresponding path program 376 times [2020-02-10 20:15:54,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:54,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779250725] [2020-02-10 20:15:54,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:54,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:54,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779250725] [2020-02-10 20:15:54,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:54,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:54,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781998174] [2020-02-10 20:15:54,948 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:54,948 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:54,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:54,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:54,948 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:15:55,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,090 INFO L93 Difference]: Finished difference Result 1448 states and 5071 transitions. [2020-02-10 20:15:55,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:55,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:55,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,093 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:15:55,094 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:15:55,094 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:55,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:15:55,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:15:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:15:55,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3157 transitions. [2020-02-10 20:15:55,116 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3157 transitions. Word has length 25 [2020-02-10 20:15:55,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,116 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3157 transitions. [2020-02-10 20:15:55,116 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:55,116 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3157 transitions. [2020-02-10 20:15:55,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:55,118 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,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, 1, 1, 1] [2020-02-10 20:15:55,118 INFO L427 AbstractCegarLoop]: === Iteration 384 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,119 INFO L82 PathProgramCache]: Analyzing trace with hash 790375611, now seen corresponding path program 377 times [2020-02-10 20:15:55,119 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,119 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091922986] [2020-02-10 20:15:55,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:55,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:55,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091922986] [2020-02-10 20:15:55,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:55,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:55,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955744794] [2020-02-10 20:15:55,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:55,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:55,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:55,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:55,522 INFO L87 Difference]: Start difference. First operand 793 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:15:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:55,680 INFO L93 Difference]: Finished difference Result 1454 states and 5084 transitions. [2020-02-10 20:15:55,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:55,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:55,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:55,685 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:15:55,685 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:15:55,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:55,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:15:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 798. [2020-02-10 20:15:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:15:55,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3166 transitions. [2020-02-10 20:15:55,710 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3166 transitions. Word has length 25 [2020-02-10 20:15:55,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:55,710 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3166 transitions. [2020-02-10 20:15:55,710 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3166 transitions. [2020-02-10 20:15:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:55,711 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:55,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, 1, 1, 1] [2020-02-10 20:15:55,712 INFO L427 AbstractCegarLoop]: === Iteration 385 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:55,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1893650727, now seen corresponding path program 378 times [2020-02-10 20:15:55,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:55,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880831583] [2020-02-10 20:15:55,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:55,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:56,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:56,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880831583] [2020-02-10 20:15:56,110 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:56,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:56,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419869493] [2020-02-10 20:15:56,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:56,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:56,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:56,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:56,111 INFO L87 Difference]: Start difference. First operand 798 states and 3166 transitions. Second operand 10 states. [2020-02-10 20:15:56,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:56,256 INFO L93 Difference]: Finished difference Result 1452 states and 5075 transitions. [2020-02-10 20:15:56,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:56,256 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:56,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:56,260 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:15:56,260 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:15:56,261 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:56,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:15:56,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 789. [2020-02-10 20:15:56,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:15:56,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3146 transitions. [2020-02-10 20:15:56,285 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3146 transitions. Word has length 25 [2020-02-10 20:15:56,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:56,285 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3146 transitions. [2020-02-10 20:15:56,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:56,286 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3146 transitions. [2020-02-10 20:15:56,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:56,287 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:56,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, 1, 1, 1] [2020-02-10 20:15:56,287 INFO L427 AbstractCegarLoop]: === Iteration 386 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:56,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:56,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1521262217, now seen corresponding path program 379 times [2020-02-10 20:15:56,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:56,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587907859] [2020-02-10 20:15:56,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:56,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 20:15:56,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587907859] [2020-02-10 20:15:56,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:56,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:56,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142192459] [2020-02-10 20:15:56,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:56,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:56,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:56,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:56,689 INFO L87 Difference]: Start difference. First operand 789 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:15:56,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:56,819 INFO L93 Difference]: Finished difference Result 1461 states and 5108 transitions. [2020-02-10 20:15:56,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:56,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:56,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:56,823 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:15:56,823 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:15:56,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:56,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:15:56,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 800. [2020-02-10 20:15:56,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:15:56,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3176 transitions. [2020-02-10 20:15:56,846 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3176 transitions. Word has length 25 [2020-02-10 20:15:56,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:56,846 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3176 transitions. [2020-02-10 20:15:56,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:56,846 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3176 transitions. [2020-02-10 20:15:56,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:56,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:56,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, 1, 1, 1] [2020-02-10 20:15:56,848 INFO L427 AbstractCegarLoop]: === Iteration 387 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1700619699, now seen corresponding path program 380 times [2020-02-10 20:15:56,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:56,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123487571] [2020-02-10 20:15:56,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123487571] [2020-02-10 20:15:57,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:57,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809821051] [2020-02-10 20:15:57,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:57,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:57,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:57,259 INFO L87 Difference]: Start difference. First operand 800 states and 3176 transitions. Second operand 10 states. [2020-02-10 20:15:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,393 INFO L93 Difference]: Finished difference Result 1462 states and 5104 transitions. [2020-02-10 20:15:57,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:57,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,397 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:15:57,398 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:15:57,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:57,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:15:57,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 794. [2020-02-10 20:15:57,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:57,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3160 transitions. [2020-02-10 20:15:57,420 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3160 transitions. Word has length 25 [2020-02-10 20:15:57,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,420 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3160 transitions. [2020-02-10 20:15:57,420 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:57,420 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3160 transitions. [2020-02-10 20:15:57,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:57,421 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,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, 1, 1, 1] [2020-02-10 20:15:57,421 INFO L427 AbstractCegarLoop]: === Iteration 388 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,421 INFO L82 PathProgramCache]: Analyzing trace with hash 1173267225, now seen corresponding path program 381 times [2020-02-10 20:15:57,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579928591] [2020-02-10 20:15:57,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:57,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:57,824 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579928591] [2020-02-10 20:15:57,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:57,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:57,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692053076] [2020-02-10 20:15:57,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:57,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:57,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:57,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:57,825 INFO L87 Difference]: Start difference. First operand 794 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:15:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:57,960 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:15:57,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:57,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:57,964 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:15:57,964 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:15:57,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:57,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:15:57,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 799. [2020-02-10 20:15:57,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:15:57,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3169 transitions. [2020-02-10 20:15:57,986 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3169 transitions. Word has length 25 [2020-02-10 20:15:57,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:57,986 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3169 transitions. [2020-02-10 20:15:57,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:57,986 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3169 transitions. [2020-02-10 20:15:57,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:57,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:57,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, 1, 1, 1] [2020-02-10 20:15:57,988 INFO L427 AbstractCegarLoop]: === Iteration 389 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:57,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:57,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1711122803, now seen corresponding path program 382 times [2020-02-10 20:15:57,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:57,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681221436] [2020-02-10 20:15:57,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:58,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681221436] [2020-02-10 20:15:58,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:58,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:58,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54730217] [2020-02-10 20:15:58,406 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:58,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:58,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:58,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:58,407 INFO L87 Difference]: Start difference. First operand 799 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:15:58,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:58,541 INFO L93 Difference]: Finished difference Result 1457 states and 5089 transitions. [2020-02-10 20:15:58,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:58,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:58,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:58,546 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:15:58,546 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:15:58,546 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:58,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:15:58,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 20:15:58,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:15:58,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3155 transitions. [2020-02-10 20:15:58,569 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3155 transitions. Word has length 25 [2020-02-10 20:15:58,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:58,569 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3155 transitions. [2020-02-10 20:15:58,569 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:58,569 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3155 transitions. [2020-02-10 20:15:58,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:58,570 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:58,570 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:58,570 INFO L427 AbstractCegarLoop]: === Iteration 390 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:58,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:58,570 INFO L82 PathProgramCache]: Analyzing trace with hash 1194273433, now seen corresponding path program 383 times [2020-02-10 20:15:58,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:58,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852307039] [2020-02-10 20:15:58,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:58,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:58,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852307039] [2020-02-10 20:15:58,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:58,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:58,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633627203] [2020-02-10 20:15:58,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:58,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:58,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:58,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:58,972 INFO L87 Difference]: Start difference. First operand 794 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:15:59,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,107 INFO L93 Difference]: Finished difference Result 1460 states and 5095 transitions. [2020-02-10 20:15:59,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:59,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:59,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,111 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:15:59,111 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:15:59,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:59,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:15:59,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 799. [2020-02-10 20:15:59,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:15:59,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3164 transitions. [2020-02-10 20:15:59,134 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3164 transitions. Word has length 25 [2020-02-10 20:15:59,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,134 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3164 transitions. [2020-02-10 20:15:59,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:59,135 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3164 transitions. [2020-02-10 20:15:59,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:59,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15:59,136 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:15:59,136 INFO L427 AbstractCegarLoop]: === Iteration 391 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1489752905, now seen corresponding path program 384 times [2020-02-10 20:15:59,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132327370] [2020-02-10 20:15:59,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:15:59,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:15:59,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132327370] [2020-02-10 20:15:59,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:15:59,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:15:59,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820423934] [2020-02-10 20:15:59,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:15:59,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:15:59,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:15:59,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:15:59,542 INFO L87 Difference]: Start difference. First operand 799 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:15:59,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:15:59,680 INFO L93 Difference]: Finished difference Result 1458 states and 5086 transitions. [2020-02-10 20:15:59,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:15:59,681 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:15:59,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:15:59,685 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:15:59,685 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:15:59,685 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:15:59,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:15:59,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 785. [2020-02-10 20:15:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:15:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3135 transitions. [2020-02-10 20:15:59,708 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3135 transitions. Word has length 25 [2020-02-10 20:15:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:15:59,708 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3135 transitions. [2020-02-10 20:15:59,708 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:15:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3135 transitions. [2020-02-10 20:15:59,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:15:59,709 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:15: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, 1, 1, 1] [2020-02-10 20:15:59,709 INFO L427 AbstractCegarLoop]: === Iteration 392 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:15:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:15:59,709 INFO L82 PathProgramCache]: Analyzing trace with hash 307500855, now seen corresponding path program 385 times [2020-02-10 20:15:59,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:15:59,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766601282] [2020-02-10 20:15:59,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:15:59,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:00,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766601282] [2020-02-10 20:16:00,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:00,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409249013] [2020-02-10 20:16:00,105 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:00,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:00,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:00,106 INFO L87 Difference]: Start difference. First operand 785 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:16:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:00,250 INFO L93 Difference]: Finished difference Result 1471 states and 5138 transitions. [2020-02-10 20:16:00,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:00,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:00,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:00,254 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:16:00,254 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 20:16:00,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:00,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 20:16:00,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 800. [2020-02-10 20:16:00,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:00,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3185 transitions. [2020-02-10 20:16:00,276 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3185 transitions. Word has length 25 [2020-02-10 20:16:00,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:00,277 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3185 transitions. [2020-02-10 20:16:00,277 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:00,277 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3185 transitions. [2020-02-10 20:16:00,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:00,278 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:00,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, 1, 1, 1] [2020-02-10 20:16:00,278 INFO L427 AbstractCegarLoop]: === Iteration 393 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:00,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:00,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1277752469, now seen corresponding path program 386 times [2020-02-10 20:16:00,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:00,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84243854] [2020-02-10 20:16:00,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:00,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84243854] [2020-02-10 20:16:00,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:00,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:00,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948821291] [2020-02-10 20:16:00,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:00,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:00,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:00,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:00,674 INFO L87 Difference]: Start difference. First operand 800 states and 3185 transitions. Second operand 10 states. [2020-02-10 20:16:00,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:00,818 INFO L93 Difference]: Finished difference Result 1473 states and 5138 transitions. [2020-02-10 20:16:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:00,819 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:00,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:00,822 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:16:00,823 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:16:00,823 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:00,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:16:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 20:16:00,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:00,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3174 transitions. [2020-02-10 20:16:00,846 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3174 transitions. Word has length 25 [2020-02-10 20:16:00,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:00,846 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3174 transitions. [2020-02-10 20:16:00,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:00,846 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3174 transitions. [2020-02-10 20:16:00,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:00,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:00,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, 1, 1, 1] [2020-02-10 20:16:00,847 INFO L427 AbstractCegarLoop]: === Iteration 394 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:00,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:00,847 INFO L82 PathProgramCache]: Analyzing trace with hash -135398285, now seen corresponding path program 387 times [2020-02-10 20:16:00,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:00,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806856756] [2020-02-10 20:16:00,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:00,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806856756] [2020-02-10 20:16:01,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:01,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122338507] [2020-02-10 20:16:01,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:01,253 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:01,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:01,253 INFO L87 Difference]: Start difference. First operand 796 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:16:01,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,393 INFO L93 Difference]: Finished difference Result 1472 states and 5136 transitions. [2020-02-10 20:16:01,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:01,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,397 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:16:01,398 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:16:01,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:01,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:16:01,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 800. [2020-02-10 20:16:01,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:01,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3181 transitions. [2020-02-10 20:16:01,420 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:01,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,421 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3181 transitions. [2020-02-10 20:16:01,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:01,421 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3181 transitions. [2020-02-10 20:16:01,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:01,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,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, 1, 1, 1] [2020-02-10 20:16:01,422 INFO L427 AbstractCegarLoop]: === Iteration 395 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,422 INFO L82 PathProgramCache]: Analyzing trace with hash 855859537, now seen corresponding path program 388 times [2020-02-10 20:16:01,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208280342] [2020-02-10 20:16:01,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:01,821 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:01,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208280342] [2020-02-10 20:16:01,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:01,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:01,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029726917] [2020-02-10 20:16:01,822 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:01,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:01,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:01,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:01,823 INFO L87 Difference]: Start difference. First operand 800 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:01,967 INFO L93 Difference]: Finished difference Result 1475 states and 5138 transitions. [2020-02-10 20:16:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:01,968 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:01,972 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:16:01,972 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:16:01,972 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:01,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:16:01,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 796. [2020-02-10 20:16:01,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3170 transitions. [2020-02-10 20:16:01,995 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3170 transitions. Word has length 25 [2020-02-10 20:16:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:01,995 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3170 transitions. [2020-02-10 20:16:01,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:01,995 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3170 transitions. [2020-02-10 20:16:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:01,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:01,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, 1, 1, 1] [2020-02-10 20:16:01,996 INFO L427 AbstractCegarLoop]: === Iteration 396 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:01,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:01,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1941973879, now seen corresponding path program 389 times [2020-02-10 20:16:01,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:01,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837921455] [2020-02-10 20:16:01,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:02,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:02,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837921455] [2020-02-10 20:16:02,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:02,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:02,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167327834] [2020-02-10 20:16:02,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:02,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:02,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:02,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:02,420 INFO L87 Difference]: Start difference. First operand 796 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:16:02,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:02,551 INFO L93 Difference]: Finished difference Result 1478 states and 5146 transitions. [2020-02-10 20:16:02,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:02,552 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:02,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:02,555 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:16:02,555 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:16:02,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:16:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 802. [2020-02-10 20:16:02,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 20:16:02,578 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:02,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:02,578 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 20:16:02,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 20:16:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:02,580 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:02,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, 1, 1, 1] [2020-02-10 20:16:02,580 INFO L427 AbstractCegarLoop]: === Iteration 397 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:02,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:02,580 INFO L82 PathProgramCache]: Analyzing trace with hash 868888499, now seen corresponding path program 390 times [2020-02-10 20:16:02,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:02,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811587080] [2020-02-10 20:16:02,580 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:02,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811587080] [2020-02-10 20:16:02,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:02,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:02,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681657722] [2020-02-10 20:16:02,987 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:02,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:02,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:02,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:02,987 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:03,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,145 INFO L93 Difference]: Finished difference Result 1479 states and 5142 transitions. [2020-02-10 20:16:03,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:03,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:03,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,149 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:16:03,150 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:16:03,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:03,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:16:03,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 20:16:03,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:16:03,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3159 transitions. [2020-02-10 20:16:03,173 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3159 transitions. Word has length 25 [2020-02-10 20:16:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:03,173 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3159 transitions. [2020-02-10 20:16:03,173 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3159 transitions. [2020-02-10 20:16:03,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:03,174 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:03,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, 1, 1, 1] [2020-02-10 20:16:03,174 INFO L427 AbstractCegarLoop]: === Iteration 398 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:03,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:03,174 INFO L82 PathProgramCache]: Analyzing trace with hash -537470597, now seen corresponding path program 391 times [2020-02-10 20:16:03,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:03,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032776851] [2020-02-10 20:16:03,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:03,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:03,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032776851] [2020-02-10 20:16:03,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:03,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:03,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444847255] [2020-02-10 20:16:03,576 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:03,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:03,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:03,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:03,576 INFO L87 Difference]: Start difference. First operand 792 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:16:03,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:03,731 INFO L93 Difference]: Finished difference Result 1476 states and 5144 transitions. [2020-02-10 20:16:03,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:03,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:03,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:03,734 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:16:03,735 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:16:03,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:03,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:16:03,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 801. [2020-02-10 20:16:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:03,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3184 transitions. [2020-02-10 20:16:03,757 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3184 transitions. Word has length 25 [2020-02-10 20:16:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:03,757 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3184 transitions. [2020-02-10 20:16:03,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3184 transitions. [2020-02-10 20:16:03,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:03,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:03,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, 1, 1, 1] [2020-02-10 20:16:03,759 INFO L427 AbstractCegarLoop]: === Iteration 399 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:03,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:03,759 INFO L82 PathProgramCache]: Analyzing trace with hash 432781017, now seen corresponding path program 392 times [2020-02-10 20:16:03,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:03,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336970587] [2020-02-10 20:16:03,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:03,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,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 20:16:04,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336970587] [2020-02-10 20:16:04,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:04,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021621985] [2020-02-10 20:16:04,159 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:04,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:04,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:04,160 INFO L87 Difference]: Start difference. First operand 801 states and 3184 transitions. Second operand 10 states. [2020-02-10 20:16:04,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:04,308 INFO L93 Difference]: Finished difference Result 1478 states and 5144 transitions. [2020-02-10 20:16:04,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:04,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:04,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:04,312 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:16:04,313 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:16:04,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:16:04,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 797. [2020-02-10 20:16:04,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:16:04,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3173 transitions. [2020-02-10 20:16:04,335 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3173 transitions. Word has length 25 [2020-02-10 20:16:04,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,335 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3173 transitions. [2020-02-10 20:16:04,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:04,336 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3173 transitions. [2020-02-10 20:16:04,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:04,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,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, 1, 1, 1] [2020-02-10 20:16:04,337 INFO L427 AbstractCegarLoop]: === Iteration 400 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1423268877, now seen corresponding path program 393 times [2020-02-10 20:16:04,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188410638] [2020-02-10 20:16:04,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:04,747 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:04,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188410638] [2020-02-10 20:16:04,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:04,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:04,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605061537] [2020-02-10 20:16:04,748 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:04,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:04,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:04,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:04,749 INFO L87 Difference]: Start difference. First operand 797 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:16:04,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:04,921 INFO L93 Difference]: Finished difference Result 1480 states and 5147 transitions. [2020-02-10 20:16:04,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:04,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:04,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:04,925 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:16:04,925 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:16:04,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:04,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:16:04,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 802. [2020-02-10 20:16:04,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:04,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3182 transitions. [2020-02-10 20:16:04,947 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3182 transitions. Word has length 25 [2020-02-10 20:16:04,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:04,947 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3182 transitions. [2020-02-10 20:16:04,947 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:04,948 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3182 transitions. [2020-02-10 20:16:04,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:04,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:04,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, 1, 1, 1] [2020-02-10 20:16:04,949 INFO L427 AbstractCegarLoop]: === Iteration 401 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:04,949 INFO L82 PathProgramCache]: Analyzing trace with hash -411004847, now seen corresponding path program 394 times [2020-02-10 20:16:04,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:04,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954166427] [2020-02-10 20:16:04,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954166427] [2020-02-10 20:16:05,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:05,368 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37471576] [2020-02-10 20:16:05,368 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:05,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:05,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:05,368 INFO L87 Difference]: Start difference. First operand 802 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:16:05,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:05,490 INFO L93 Difference]: Finished difference Result 1485 states and 5152 transitions. [2020-02-10 20:16:05,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:05,490 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:05,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:05,494 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:16:05,494 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:16:05,494 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:05,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:16:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 797. [2020-02-10 20:16:05,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:16:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3168 transitions. [2020-02-10 20:16:05,516 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3168 transitions. Word has length 25 [2020-02-10 20:16:05,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:05,516 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3168 transitions. [2020-02-10 20:16:05,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:05,516 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3168 transitions. [2020-02-10 20:16:05,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:05,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:05,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, 1, 1, 1] [2020-02-10 20:16:05,517 INFO L427 AbstractCegarLoop]: === Iteration 402 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:05,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:05,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1748194875, now seen corresponding path program 395 times [2020-02-10 20:16:05,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:05,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625575546] [2020-02-10 20:16:05,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:05,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:05,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625575546] [2020-02-10 20:16:05,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:05,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:05,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218382024] [2020-02-10 20:16:05,916 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:05,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:05,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:05,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:05,916 INFO L87 Difference]: Start difference. First operand 797 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:16:06,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,072 INFO L93 Difference]: Finished difference Result 1486 states and 5156 transitions. [2020-02-10 20:16:06,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:06,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:06,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,076 INFO L225 Difference]: With dead ends: 1486 [2020-02-10 20:16:06,076 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:16:06,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:06,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:16:06,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 20:16:06,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:16:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3181 transitions. [2020-02-10 20:16:06,099 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:06,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,099 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3181 transitions. [2020-02-10 20:16:06,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:06,099 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3181 transitions. [2020-02-10 20:16:06,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:06,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,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, 1, 1, 1] [2020-02-10 20:16:06,100 INFO L427 AbstractCegarLoop]: === Iteration 403 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,101 INFO L82 PathProgramCache]: Analyzing trace with hash -397975885, now seen corresponding path program 396 times [2020-02-10 20:16:06,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39045758] [2020-02-10 20:16:06,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:06,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:06,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39045758] [2020-02-10 20:16:06,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:06,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:06,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856442435] [2020-02-10 20:16:06,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:06,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:06,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:06,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:06,532 INFO L87 Difference]: Start difference. First operand 804 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:06,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:06,694 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 20:16:06,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:06,694 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:06,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:06,698 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:16:06,698 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:16:06,699 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:06,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:16:06,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 792. [2020-02-10 20:16:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:16:06,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3154 transitions. [2020-02-10 20:16:06,721 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3154 transitions. Word has length 25 [2020-02-10 20:16:06,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:06,721 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3154 transitions. [2020-02-10 20:16:06,721 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:06,721 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3154 transitions. [2020-02-10 20:16:06,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:06,722 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:06,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, 1, 1, 1] [2020-02-10 20:16:06,722 INFO L427 AbstractCegarLoop]: === Iteration 404 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:06,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:06,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1825341189, now seen corresponding path program 397 times [2020-02-10 20:16:06,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:06,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726610346] [2020-02-10 20:16:06,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726610346] [2020-02-10 20:16:07,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,138 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:07,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603698617] [2020-02-10 20:16:07,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:07,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:07,139 INFO L87 Difference]: Start difference. First operand 792 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:16:07,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:07,289 INFO L93 Difference]: Finished difference Result 1481 states and 5149 transitions. [2020-02-10 20:16:07,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:07,290 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:07,293 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 20:16:07,293 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:16:07,294 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:07,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:16:07,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 802. [2020-02-10 20:16:07,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3181 transitions. [2020-02-10 20:16:07,317 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:07,317 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3181 transitions. [2020-02-10 20:16:07,317 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3181 transitions. [2020-02-10 20:16:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:07,318 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:07,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, 1, 1, 1] [2020-02-10 20:16:07,318 INFO L427 AbstractCegarLoop]: === Iteration 405 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:07,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:07,318 INFO L82 PathProgramCache]: Analyzing trace with hash -834083367, now seen corresponding path program 398 times [2020-02-10 20:16:07,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:07,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015666980] [2020-02-10 20:16:07,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:07,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:07,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:07,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015666980] [2020-02-10 20:16:07,729 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:07,729 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:07,729 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745922869] [2020-02-10 20:16:07,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:07,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:07,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:07,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:07,730 INFO L87 Difference]: Start difference. First operand 802 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:07,880 INFO L93 Difference]: Finished difference Result 1484 states and 5151 transitions. [2020-02-10 20:16:07,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:07,881 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:07,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:07,884 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:16:07,884 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 20:16:07,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:07,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 20:16:07,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 798. [2020-02-10 20:16:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3170 transitions. [2020-02-10 20:16:07,906 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3170 transitions. Word has length 25 [2020-02-10 20:16:07,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:07,906 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3170 transitions. [2020-02-10 20:16:07,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:07,906 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3170 transitions. [2020-02-10 20:16:07,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:07,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:07,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, 1, 1, 1] [2020-02-10 20:16:07,908 INFO L427 AbstractCegarLoop]: === Iteration 406 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:07,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:07,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2026726967, now seen corresponding path program 399 times [2020-02-10 20:16:07,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:07,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677786976] [2020-02-10 20:16:07,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677786976] [2020-02-10 20:16:08,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:08,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056846784] [2020-02-10 20:16:08,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:08,325 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:08,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:08,325 INFO L87 Difference]: Start difference. First operand 798 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:16:08,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:08,478 INFO L93 Difference]: Finished difference Result 1484 states and 5150 transitions. [2020-02-10 20:16:08,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:08,479 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:08,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:08,482 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:16:08,483 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:16:08,483 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:08,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:16:08,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 803. [2020-02-10 20:16:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:16:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3179 transitions. [2020-02-10 20:16:08,506 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3179 transitions. Word has length 25 [2020-02-10 20:16:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:08,506 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3179 transitions. [2020-02-10 20:16:08,506 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:08,506 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3179 transitions. [2020-02-10 20:16:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:08,507 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:08,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, 1, 1, 1] [2020-02-10 20:16:08,507 INFO L427 AbstractCegarLoop]: === Iteration 407 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:08,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:08,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1255976299, now seen corresponding path program 400 times [2020-02-10 20:16:08,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:08,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288898634] [2020-02-10 20:16:08,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:08,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:08,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288898634] [2020-02-10 20:16:08,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:08,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:08,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884807608] [2020-02-10 20:16:08,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:08,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:08,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:08,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:08,924 INFO L87 Difference]: Start difference. First operand 803 states and 3179 transitions. Second operand 10 states. [2020-02-10 20:16:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,051 INFO L93 Difference]: Finished difference Result 1489 states and 5155 transitions. [2020-02-10 20:16:09,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:09,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,055 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:16:09,055 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 20:16:09,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:09,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 20:16:09,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 798. [2020-02-10 20:16:09,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:09,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3165 transitions. [2020-02-10 20:16:09,078 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3165 transitions. Word has length 25 [2020-02-10 20:16:09,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,078 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3165 transitions. [2020-02-10 20:16:09,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3165 transitions. [2020-02-10 20:16:09,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:09,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:09,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, 1, 1, 1] [2020-02-10 20:16:09,079 INFO L427 AbstractCegarLoop]: === Iteration 408 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,079 INFO L82 PathProgramCache]: Analyzing trace with hash 481330491, now seen corresponding path program 401 times [2020-02-10 20:16:09,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077761927] [2020-02-10 20:16:09,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:09,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 20:16:09,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077761927] [2020-02-10 20:16:09,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:09,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:09,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080640098] [2020-02-10 20:16:09,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:09,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:09,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:09,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:09,501 INFO L87 Difference]: Start difference. First operand 798 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:16:09,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:09,695 INFO L93 Difference]: Finished difference Result 1494 states and 5167 transitions. [2020-02-10 20:16:09,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:09,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:09,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:09,699 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:16:09,699 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:16:09,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:09,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:16:09,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 807. [2020-02-10 20:16:09,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:16:09,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3181 transitions. [2020-02-10 20:16:09,722 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:09,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:09,722 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3181 transitions. [2020-02-10 20:16:09,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:09,722 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3181 transitions. [2020-02-10 20:16:09,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:09,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:09,723 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:09,723 INFO L427 AbstractCegarLoop]: === Iteration 409 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:09,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:09,724 INFO L82 PathProgramCache]: Analyzing trace with hash -591754889, now seen corresponding path program 402 times [2020-02-10 20:16:09,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:09,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627079767] [2020-02-10 20:16:09,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:09,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:10,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:10,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627079767] [2020-02-10 20:16:10,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:10,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:10,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306014831] [2020-02-10 20:16:10,162 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:10,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:10,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:10,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:10,162 INFO L87 Difference]: Start difference. First operand 807 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:10,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:10,338 INFO L93 Difference]: Finished difference Result 1496 states and 5163 transitions. [2020-02-10 20:16:10,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:10,338 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:10,342 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:16:10,342 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:16:10,342 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:10,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:16:10,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 792. [2020-02-10 20:16:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:16:10,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3148 transitions. [2020-02-10 20:16:10,365 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3148 transitions. Word has length 25 [2020-02-10 20:16:10,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,365 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3148 transitions. [2020-02-10 20:16:10,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:10,365 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3148 transitions. [2020-02-10 20:16:10,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:10,366 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,366 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:10,366 INFO L427 AbstractCegarLoop]: === Iteration 410 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,366 INFO L82 PathProgramCache]: Analyzing trace with hash -229869483, now seen corresponding path program 403 times [2020-02-10 20:16:10,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50650360] [2020-02-10 20:16:10,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:10,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:10,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50650360] [2020-02-10 20:16:10,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:10,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:10,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232387928] [2020-02-10 20:16:10,814 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:10,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:10,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:10,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:10,814 INFO L87 Difference]: Start difference. First operand 792 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:16:10,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:10,960 INFO L93 Difference]: Finished difference Result 1496 states and 5182 transitions. [2020-02-10 20:16:10,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:10,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:10,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:10,964 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:16:10,965 INFO L226 Difference]: Without dead ends: 1481 [2020-02-10 20:16:10,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:10,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1481 states. [2020-02-10 20:16:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1481 to 807. [2020-02-10 20:16:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:16:10,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3188 transitions. [2020-02-10 20:16:10,988 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3188 transitions. Word has length 25 [2020-02-10 20:16:10,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:10,988 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3188 transitions. [2020-02-10 20:16:10,988 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:10,988 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3188 transitions. [2020-02-10 20:16:10,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:10,989 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:10,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, 1, 1, 1] [2020-02-10 20:16:10,989 INFO L427 AbstractCegarLoop]: === Iteration 411 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:10,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:10,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1302954863, now seen corresponding path program 404 times [2020-02-10 20:16:10,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:10,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768155895] [2020-02-10 20:16:10,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:10,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:11,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:11,442 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768155895] [2020-02-10 20:16:11,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:11,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:11,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003797371] [2020-02-10 20:16:11,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:11,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:11,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:11,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:11,443 INFO L87 Difference]: Start difference. First operand 807 states and 3188 transitions. Second operand 10 states. [2020-02-10 20:16:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:11,589 INFO L93 Difference]: Finished difference Result 1497 states and 5178 transitions. [2020-02-10 20:16:11,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:11,589 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:11,593 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:16:11,593 INFO L226 Difference]: Without dead ends: 1475 [2020-02-10 20:16:11,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:11,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2020-02-10 20:16:11,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 801. [2020-02-10 20:16:11,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:11,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3171 transitions. [2020-02-10 20:16:11,616 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3171 transitions. Word has length 25 [2020-02-10 20:16:11,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:11,616 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3171 transitions. [2020-02-10 20:16:11,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:11,617 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3171 transitions. [2020-02-10 20:16:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:11,618 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:11,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, 1, 1, 1] [2020-02-10 20:16:11,618 INFO L427 AbstractCegarLoop]: === Iteration 412 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:11,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:11,618 INFO L82 PathProgramCache]: Analyzing trace with hash 864222105, now seen corresponding path program 405 times [2020-02-10 20:16:11,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:11,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861223383] [2020-02-10 20:16:11,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:11,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861223383] [2020-02-10 20:16:12,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:12,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625957908] [2020-02-10 20:16:12,035 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:12,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:12,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:12,035 INFO L87 Difference]: Start difference. First operand 801 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:16:12,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:12,188 INFO L93 Difference]: Finished difference Result 1499 states and 5181 transitions. [2020-02-10 20:16:12,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:12,189 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:12,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:12,192 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:16:12,193 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:16:12,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:12,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:16:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 808. [2020-02-10 20:16:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:16:12,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3184 transitions. [2020-02-10 20:16:12,216 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3184 transitions. Word has length 25 [2020-02-10 20:16:12,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:12,216 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3184 transitions. [2020-02-10 20:16:12,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:12,216 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3184 transitions. [2020-02-10 20:16:12,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:12,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:12,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, 1, 1, 1] [2020-02-10 20:16:12,217 INFO L427 AbstractCegarLoop]: === Iteration 413 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:12,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:12,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1281948655, now seen corresponding path program 406 times [2020-02-10 20:16:12,218 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:12,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023878874] [2020-02-10 20:16:12,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:12,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:12,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:12,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023878874] [2020-02-10 20:16:12,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:12,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:12,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561469206] [2020-02-10 20:16:12,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:12,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:12,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:12,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:12,641 INFO L87 Difference]: Start difference. First operand 808 states and 3184 transitions. Second operand 10 states. [2020-02-10 20:16:12,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:12,761 INFO L93 Difference]: Finished difference Result 1502 states and 5180 transitions. [2020-02-10 20:16:12,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:12,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:12,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:12,766 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 20:16:12,766 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 20:16:12,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 20:16:12,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 801. [2020-02-10 20:16:12,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:12,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3164 transitions. [2020-02-10 20:16:12,789 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3164 transitions. Word has length 25 [2020-02-10 20:16:12,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:12,789 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3164 transitions. [2020-02-10 20:16:12,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:12,789 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3164 transitions. [2020-02-10 20:16:12,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:12,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:12,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, 1, 1, 1] [2020-02-10 20:16:12,790 INFO L427 AbstractCegarLoop]: === Iteration 414 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:12,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:12,790 INFO L82 PathProgramCache]: Analyzing trace with hash 885228313, now seen corresponding path program 407 times [2020-02-10 20:16:12,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:12,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136536511] [2020-02-10 20:16:12,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,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 20:16:13,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136536511] [2020-02-10 20:16:13,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:13,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236103530] [2020-02-10 20:16:13,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:13,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:13,223 INFO L87 Difference]: Start difference. First operand 801 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:16:13,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:13,414 INFO L93 Difference]: Finished difference Result 1503 states and 5182 transitions. [2020-02-10 20:16:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:13,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:13,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:13,419 INFO L225 Difference]: With dead ends: 1503 [2020-02-10 20:16:13,419 INFO L226 Difference]: Without dead ends: 1487 [2020-02-10 20:16:13,419 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1487 states. [2020-02-10 20:16:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1487 to 810. [2020-02-10 20:16:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:16:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3180 transitions. [2020-02-10 20:16:13,442 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3180 transitions. Word has length 25 [2020-02-10 20:16:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:13,442 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3180 transitions. [2020-02-10 20:16:13,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3180 transitions. [2020-02-10 20:16:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:13,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:13,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, 1, 1, 1] [2020-02-10 20:16:13,443 INFO L427 AbstractCegarLoop]: === Iteration 415 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:13,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash -187857067, now seen corresponding path program 408 times [2020-02-10 20:16:13,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:13,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568050417] [2020-02-10 20:16:13,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:13,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:13,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568050417] [2020-02-10 20:16:13,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:13,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:13,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563462378] [2020-02-10 20:16:13,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:13,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:13,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:13,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:13,873 INFO L87 Difference]: Start difference. First operand 810 states and 3180 transitions. Second operand 10 states. [2020-02-10 20:16:14,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,032 INFO L93 Difference]: Finished difference Result 1505 states and 5178 transitions. [2020-02-10 20:16:14,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:14,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:14,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,037 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 20:16:14,037 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:16:14,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:16:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 785. [2020-02-10 20:16:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:16:14,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3128 transitions. [2020-02-10 20:16:14,059 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3128 transitions. Word has length 25 [2020-02-10 20:16:14,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,059 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3128 transitions. [2020-02-10 20:16:14,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:14,059 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3128 transitions. [2020-02-10 20:16:14,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:14,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,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, 1, 1, 1] [2020-02-10 20:16:14,060 INFO L427 AbstractCegarLoop]: === Iteration 416 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash -327140489, now seen corresponding path program 409 times [2020-02-10 20:16:14,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357768423] [2020-02-10 20:16:14,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:14,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357768423] [2020-02-10 20:16:14,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:14,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:14,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333110757] [2020-02-10 20:16:14,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:14,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:14,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:14,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:14,467 INFO L87 Difference]: Start difference. First operand 785 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:16:14,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:14,639 INFO L93 Difference]: Finished difference Result 1456 states and 5096 transitions. [2020-02-10 20:16:14,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:14,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:14,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:14,643 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:16:14,643 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:16:14,643 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:14,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:16:14,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 798. [2020-02-10 20:16:14,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3173 transitions. [2020-02-10 20:16:14,666 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3173 transitions. Word has length 25 [2020-02-10 20:16:14,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:14,666 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3173 transitions. [2020-02-10 20:16:14,666 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:14,666 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3173 transitions. [2020-02-10 20:16:14,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:14,667 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:14,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, 1, 1, 1] [2020-02-10 20:16:14,667 INFO L427 AbstractCegarLoop]: === Iteration 417 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:14,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:14,668 INFO L82 PathProgramCache]: Analyzing trace with hash 643111125, now seen corresponding path program 410 times [2020-02-10 20:16:14,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:14,668 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812225408] [2020-02-10 20:16:14,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:14,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:15,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:15,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812225408] [2020-02-10 20:16:15,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:15,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:15,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476988195] [2020-02-10 20:16:15,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:15,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:15,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:15,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:15,089 INFO L87 Difference]: Start difference. First operand 798 states and 3173 transitions. Second operand 10 states. [2020-02-10 20:16:15,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:15,236 INFO L93 Difference]: Finished difference Result 1458 states and 5096 transitions. [2020-02-10 20:16:15,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:15,237 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:15,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:15,240 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:16:15,240 INFO L226 Difference]: Without dead ends: 1439 [2020-02-10 20:16:15,241 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:15,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2020-02-10 20:16:15,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 794. [2020-02-10 20:16:15,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:16:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3162 transitions. [2020-02-10 20:16:15,263 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3162 transitions. Word has length 25 [2020-02-10 20:16:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:15,263 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3162 transitions. [2020-02-10 20:16:15,263 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3162 transitions. [2020-02-10 20:16:15,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:15,265 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:15,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, 1, 1, 1] [2020-02-10 20:16:15,265 INFO L427 AbstractCegarLoop]: === Iteration 418 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:15,265 INFO L82 PathProgramCache]: Analyzing trace with hash 1155994449, now seen corresponding path program 411 times [2020-02-10 20:16:15,265 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:15,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159724195] [2020-02-10 20:16:15,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:15,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:15,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:15,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159724195] [2020-02-10 20:16:15,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:15,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:15,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995979689] [2020-02-10 20:16:15,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:15,672 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:15,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:15,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:15,672 INFO L87 Difference]: Start difference. First operand 794 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:16:15,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:15,824 INFO L93 Difference]: Finished difference Result 1455 states and 5090 transitions. [2020-02-10 20:16:15,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:15,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:15,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:15,827 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:16:15,828 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:16:15,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:16:15,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 798. [2020-02-10 20:16:15,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:15,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3169 transitions. [2020-02-10 20:16:15,850 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:15,851 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3169 transitions. [2020-02-10 20:16:15,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:15,851 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3169 transitions. [2020-02-10 20:16:15,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:15,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:15,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, 1, 1, 1] [2020-02-10 20:16:15,852 INFO L427 AbstractCegarLoop]: === Iteration 419 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2137211921, now seen corresponding path program 412 times [2020-02-10 20:16:15,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:15,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855307117] [2020-02-10 20:16:15,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855307117] [2020-02-10 20:16:16,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:16,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015762397] [2020-02-10 20:16:16,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:16,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:16,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:16,267 INFO L87 Difference]: Start difference. First operand 798 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:16,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:16,420 INFO L93 Difference]: Finished difference Result 1456 states and 5088 transitions. [2020-02-10 20:16:16,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:16,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:16,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:16,424 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:16:16,425 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:16:16,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:16,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:16:16,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 794. [2020-02-10 20:16:16,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:16:16,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3158 transitions. [2020-02-10 20:16:16,448 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3158 transitions. Word has length 25 [2020-02-10 20:16:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:16,448 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3158 transitions. [2020-02-10 20:16:16,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3158 transitions. [2020-02-10 20:16:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:16,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:16,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:16,449 INFO L427 AbstractCegarLoop]: === Iteration 420 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:16,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:16,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1632928759, now seen corresponding path program 413 times [2020-02-10 20:16:16,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:16,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151554179] [2020-02-10 20:16:16,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:16,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:16,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:16,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151554179] [2020-02-10 20:16:16,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:16,858 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:16,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914971052] [2020-02-10 20:16:16,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:16,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:16,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:16,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:16,858 INFO L87 Difference]: Start difference. First operand 794 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:16:17,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:17,009 INFO L93 Difference]: Finished difference Result 1460 states and 5097 transitions. [2020-02-10 20:16:17,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:17,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:17,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:17,013 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:16:17,014 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 20:16:17,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:17,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 20:16:17,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 799. [2020-02-10 20:16:17,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:17,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:16:17,038 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:17,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:17,038 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:16:17,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:17,039 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:16:17,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:17,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:17,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, 1, 1, 1] [2020-02-10 20:16:17,040 INFO L427 AbstractCegarLoop]: === Iteration 421 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:17,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:17,040 INFO L82 PathProgramCache]: Analyzing trace with hash -2124182959, now seen corresponding path program 414 times [2020-02-10 20:16:17,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:17,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922591487] [2020-02-10 20:16:17,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:17,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:17,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922591487] [2020-02-10 20:16:17,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:17,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:17,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290663117] [2020-02-10 20:16:17,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:17,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:17,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:17,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:17,445 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:17,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:17,586 INFO L93 Difference]: Finished difference Result 1459 states and 5090 transitions. [2020-02-10 20:16:17,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:17,587 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:17,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:17,591 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:16:17,591 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:16:17,591 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:16:17,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 790. [2020-02-10 20:16:17,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:16:17,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3147 transitions. [2020-02-10 20:16:17,614 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3147 transitions. Word has length 25 [2020-02-10 20:16:17,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:17,614 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3147 transitions. [2020-02-10 20:16:17,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3147 transitions. [2020-02-10 20:16:17,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:17,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:17,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, 1, 1, 1] [2020-02-10 20:16:17,615 INFO L427 AbstractCegarLoop]: === Iteration 422 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:17,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:17,615 INFO L82 PathProgramCache]: Analyzing trace with hash -749626215, now seen corresponding path program 415 times [2020-02-10 20:16:17,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:17,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936437146] [2020-02-10 20:16:17,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,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 20:16:18,014 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936437146] [2020-02-10 20:16:18,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:18,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072474301] [2020-02-10 20:16:18,015 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:18,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:18,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:18,015 INFO L87 Difference]: Start difference. First operand 790 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:16:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,154 INFO L93 Difference]: Finished difference Result 1464 states and 5109 transitions. [2020-02-10 20:16:18,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:18,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:18,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,158 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:16:18,158 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:16:18,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:18,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:16:18,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 20:16:18,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:18,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3172 transitions. [2020-02-10 20:16:18,181 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3172 transitions. Word has length 25 [2020-02-10 20:16:18,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,181 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3172 transitions. [2020-02-10 20:16:18,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:18,181 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3172 transitions. [2020-02-10 20:16:18,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:18,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,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, 1, 1, 1] [2020-02-10 20:16:18,183 INFO L427 AbstractCegarLoop]: === Iteration 423 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,183 INFO L82 PathProgramCache]: Analyzing trace with hash 220625399, now seen corresponding path program 416 times [2020-02-10 20:16:18,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087782406] [2020-02-10 20:16:18,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:18,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 20:16:18,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087782406] [2020-02-10 20:16:18,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:18,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:18,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307947825] [2020-02-10 20:16:18,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:18,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:18,579 INFO L87 Difference]: Start difference. First operand 799 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:16:18,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:18,731 INFO L93 Difference]: Finished difference Result 1466 states and 5109 transitions. [2020-02-10 20:16:18,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:18,732 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:18,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:18,735 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 20:16:18,735 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:16:18,736 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:18,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:16:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 20:16:18,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:18,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3161 transitions. [2020-02-10 20:16:18,758 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3161 transitions. Word has length 25 [2020-02-10 20:16:18,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:18,759 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3161 transitions. [2020-02-10 20:16:18,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:18,759 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3161 transitions. [2020-02-10 20:16:18,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:18,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:18,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, 1, 1, 1] [2020-02-10 20:16:18,760 INFO L427 AbstractCegarLoop]: === Iteration 424 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:18,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:18,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1635424495, now seen corresponding path program 417 times [2020-02-10 20:16:18,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:18,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891934426] [2020-02-10 20:16:18,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891934426] [2020-02-10 20:16:19,209 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:19,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929862023] [2020-02-10 20:16:19,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:19,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:19,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:19,210 INFO L87 Difference]: Start difference. First operand 795 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:16:19,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:19,347 INFO L93 Difference]: Finished difference Result 1468 states and 5112 transitions. [2020-02-10 20:16:19,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:19,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:19,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:19,351 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:16:19,351 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:16:19,352 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:19,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:16:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 800. [2020-02-10 20:16:19,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3170 transitions. [2020-02-10 20:16:19,374 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3170 transitions. Word has length 25 [2020-02-10 20:16:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:19,374 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3170 transitions. [2020-02-10 20:16:19,374 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3170 transitions. [2020-02-10 20:16:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:19,375 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:19,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, 1, 1, 1] [2020-02-10 20:16:19,375 INFO L427 AbstractCegarLoop]: === Iteration 425 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:19,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:19,376 INFO L82 PathProgramCache]: Analyzing trace with hash -623160465, now seen corresponding path program 418 times [2020-02-10 20:16:19,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:19,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006011486] [2020-02-10 20:16:19,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:19,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:19,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:19,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006011486] [2020-02-10 20:16:19,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:19,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:19,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858895254] [2020-02-10 20:16:19,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:19,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:19,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:19,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:19,793 INFO L87 Difference]: Start difference. First operand 800 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:16:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:19,930 INFO L93 Difference]: Finished difference Result 1473 states and 5117 transitions. [2020-02-10 20:16:19,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:19,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:19,934 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:16:19,935 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:16:19,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:16:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 795. [2020-02-10 20:16:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:19,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:16:19,957 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:16:19,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:19,957 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:16:19,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:19,957 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:16:19,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:19,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:19,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, 1, 1, 1] [2020-02-10 20:16:19,958 INFO L427 AbstractCegarLoop]: === Iteration 426 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:19,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:19,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1536039257, now seen corresponding path program 419 times [2020-02-10 20:16:19,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:19,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976517202] [2020-02-10 20:16:19,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:20,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:20,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976517202] [2020-02-10 20:16:20,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:20,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:20,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104178248] [2020-02-10 20:16:20,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:20,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:20,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:20,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:20,367 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:16:20,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:20,508 INFO L93 Difference]: Finished difference Result 1474 states and 5121 transitions. [2020-02-10 20:16:20,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:20,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:20,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:20,512 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:16:20,512 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:16:20,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:20,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:16:20,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 802. [2020-02-10 20:16:20,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:20,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3169 transitions. [2020-02-10 20:16:20,534 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:20,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:20,535 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3169 transitions. [2020-02-10 20:16:20,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:20,535 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3169 transitions. [2020-02-10 20:16:20,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:20,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:20,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, 1, 1, 1] [2020-02-10 20:16:20,536 INFO L427 AbstractCegarLoop]: === Iteration 427 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash -610131503, now seen corresponding path program 420 times [2020-02-10 20:16:20,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:20,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766948866] [2020-02-10 20:16:20,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:20,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:20,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766948866] [2020-02-10 20:16:20,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:20,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:20,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951337433] [2020-02-10 20:16:20,943 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:20,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:20,943 INFO L87 Difference]: Start difference. First operand 802 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:21,072 INFO L93 Difference]: Finished difference Result 1477 states and 5120 transitions. [2020-02-10 20:16:21,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:21,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:21,076 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:16:21,077 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:16:21,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:21,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:16:21,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 790. [2020-02-10 20:16:21,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:16:21,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3142 transitions. [2020-02-10 20:16:21,099 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3142 transitions. Word has length 25 [2020-02-10 20:16:21,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:21,099 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3142 transitions. [2020-02-10 20:16:21,099 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3142 transitions. [2020-02-10 20:16:21,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:21,100 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:21,101 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:21,101 INFO L427 AbstractCegarLoop]: === Iteration 428 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:21,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:21,101 INFO L82 PathProgramCache]: Analyzing trace with hash -533948455, now seen corresponding path program 421 times [2020-02-10 20:16:21,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:21,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347994880] [2020-02-10 20:16:21,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:21,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:21,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347994880] [2020-02-10 20:16:21,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:21,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:21,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471651798] [2020-02-10 20:16:21,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:21,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:21,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:21,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:21,509 INFO L87 Difference]: Start difference. First operand 790 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:16:21,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:21,656 INFO L93 Difference]: Finished difference Result 1461 states and 5097 transitions. [2020-02-10 20:16:21,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:21,656 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:21,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:21,660 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:16:21,660 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:16:21,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:21,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:16:21,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 799. [2020-02-10 20:16:21,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:16:21,683 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:21,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:21,683 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:16:21,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:21,683 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:16:21,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:21,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:21,684 INFO L427 AbstractCegarLoop]: === Iteration 429 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:21,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:21,684 INFO L82 PathProgramCache]: Analyzing trace with hash 467812471, now seen corresponding path program 422 times [2020-02-10 20:16:21,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:21,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888880987] [2020-02-10 20:16:21,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:21,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:22,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:22,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888880987] [2020-02-10 20:16:22,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:22,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:22,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177334138] [2020-02-10 20:16:22,100 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:22,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:22,101 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:22,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,252 INFO L93 Difference]: Finished difference Result 1462 states and 5095 transitions. [2020-02-10 20:16:22,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:22,252 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:22,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,255 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:16:22,256 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:16:22,256 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:22,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:16:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 795. [2020-02-10 20:16:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:22,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:16:22,277 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:16:22,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,278 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:16:22,278 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:22,278 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:16:22,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:22,279 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,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, 1, 1, 1] [2020-02-10 20:16:22,279 INFO L427 AbstractCegarLoop]: === Iteration 430 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1392085623, now seen corresponding path program 423 times [2020-02-10 20:16:22,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528020460] [2020-02-10 20:16:22,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:22,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528020460] [2020-02-10 20:16:22,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:22,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:22,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049913165] [2020-02-10 20:16:22,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:22,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:22,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:22,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:22,677 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:16:22,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:22,809 INFO L93 Difference]: Finished difference Result 1466 states and 5102 transitions. [2020-02-10 20:16:22,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:22,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:22,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:22,813 INFO L225 Difference]: With dead ends: 1466 [2020-02-10 20:16:22,813 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:16:22,814 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:22,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:16:22,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 20:16:22,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 20:16:22,836 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 20:16:22,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:22,836 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 20:16:22,836 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:22,837 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 20:16:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:22,837 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:22,838 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:22,838 INFO L427 AbstractCegarLoop]: === Iteration 431 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:22,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:22,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1890617643, now seen corresponding path program 424 times [2020-02-10 20:16:22,838 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:22,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695841052] [2020-02-10 20:16:22,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695841052] [2020-02-10 20:16:23,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:23,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364505569] [2020-02-10 20:16:23,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:23,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:23,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:23,254 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:16:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:23,380 INFO L93 Difference]: Finished difference Result 1471 states and 5107 transitions. [2020-02-10 20:16:23,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:23,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:23,384 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:16:23,384 INFO L226 Difference]: Without dead ends: 1448 [2020-02-10 20:16:23,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:23,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1448 states. [2020-02-10 20:16:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1448 to 795. [2020-02-10 20:16:23,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:23,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:16:23,407 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:16:23,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:23,408 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:16:23,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:23,408 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:16:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:23,409 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:23,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, 1, 1, 1] [2020-02-10 20:16:23,409 INFO L427 AbstractCegarLoop]: === Iteration 432 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:23,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:23,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1783226329, now seen corresponding path program 425 times [2020-02-10 20:16:23,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:23,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259550364] [2020-02-10 20:16:23,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:23,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:23,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259550364] [2020-02-10 20:16:23,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:23,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:23,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383091716] [2020-02-10 20:16:23,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:23,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:23,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:23,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:23,820 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:16:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:23,981 INFO L93 Difference]: Finished difference Result 1469 states and 5104 transitions. [2020-02-10 20:16:23,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:23,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:23,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:23,985 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:16:23,985 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:16:23,985 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:23,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:16:24,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 801. [2020-02-10 20:16:24,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 20:16:24,007 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 20:16:24,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,008 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 20:16:24,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 20:16:24,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:24,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,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, 1, 1, 1] [2020-02-10 20:16:24,009 INFO L427 AbstractCegarLoop]: === Iteration 433 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,009 INFO L82 PathProgramCache]: Analyzing trace with hash -900800009, now seen corresponding path program 426 times [2020-02-10 20:16:24,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360232100] [2020-02-10 20:16:24,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:24,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:24,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360232100] [2020-02-10 20:16:24,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:24,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:24,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339050157] [2020-02-10 20:16:24,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:24,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:24,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:24,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:24,419 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:16:24,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:24,532 INFO L93 Difference]: Finished difference Result 1473 states and 5106 transitions. [2020-02-10 20:16:24,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:24,532 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:24,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:24,536 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:16:24,536 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:16:24,536 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:24,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:16:24,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 790. [2020-02-10 20:16:24,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:16:24,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 20:16:24,558 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 20:16:24,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:24,558 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 20:16:24,558 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:24,558 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 20:16:24,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:24,559 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:24,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, 1, 1, 1] [2020-02-10 20:16:24,559 INFO L427 AbstractCegarLoop]: === Iteration 434 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:24,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:24,560 INFO L82 PathProgramCache]: Analyzing trace with hash -538914603, now seen corresponding path program 427 times [2020-02-10 20:16:24,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:24,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759940169] [2020-02-10 20:16:24,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:24,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:24,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:24,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759940169] [2020-02-10 20:16:24,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:24,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:24,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616456376] [2020-02-10 20:16:24,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:24,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:24,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:24,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:24,969 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:16:25,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,127 INFO L93 Difference]: Finished difference Result 1472 states and 5120 transitions. [2020-02-10 20:16:25,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:25,128 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,131 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:16:25,132 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:16:25,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:25,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:16:25,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 801. [2020-02-10 20:16:25,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:25,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3168 transitions. [2020-02-10 20:16:25,154 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3168 transitions. Word has length 25 [2020-02-10 20:16:25,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,154 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3168 transitions. [2020-02-10 20:16:25,154 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:25,155 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3168 transitions. [2020-02-10 20:16:25,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:25,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,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, 1, 1, 1] [2020-02-10 20:16:25,156 INFO L427 AbstractCegarLoop]: === Iteration 435 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1059025, now seen corresponding path program 428 times [2020-02-10 20:16:25,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709807006] [2020-02-10 20:16:25,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:25,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:25,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709807006] [2020-02-10 20:16:25,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:25,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:25,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343749557] [2020-02-10 20:16:25,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:25,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:25,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:25,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:25,570 INFO L87 Difference]: Start difference. First operand 801 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:16:25,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:25,713 INFO L93 Difference]: Finished difference Result 1471 states and 5113 transitions. [2020-02-10 20:16:25,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:25,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:25,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:25,718 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:16:25,718 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:16:25,718 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:16:25,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 796. [2020-02-10 20:16:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:25,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3154 transitions. [2020-02-10 20:16:25,740 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3154 transitions. Word has length 25 [2020-02-10 20:16:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:25,740 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3154 transitions. [2020-02-10 20:16:25,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:25,740 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3154 transitions. [2020-02-10 20:16:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:25,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:25,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, 1, 1, 1] [2020-02-10 20:16:25,742 INFO L427 AbstractCegarLoop]: === Iteration 436 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:25,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:25,742 INFO L82 PathProgramCache]: Analyzing trace with hash -2139352457, now seen corresponding path program 429 times [2020-02-10 20:16:25,742 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:25,742 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906856845] [2020-02-10 20:16:25,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:25,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,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 20:16:26,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906856845] [2020-02-10 20:16:26,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:26,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572014238] [2020-02-10 20:16:26,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:26,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:26,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:26,159 INFO L87 Difference]: Start difference. First operand 796 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:16:26,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:26,308 INFO L93 Difference]: Finished difference Result 1478 states and 5127 transitions. [2020-02-10 20:16:26,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:26,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:26,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:26,313 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:16:26,313 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:16:26,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:26,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:16:26,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 803. [2020-02-10 20:16:26,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:16:26,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 20:16:26,336 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:26,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:26,336 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 20:16:26,336 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:26,336 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 20:16:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:26,337 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:26,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, 1, 1, 1] [2020-02-10 20:16:26,337 INFO L427 AbstractCegarLoop]: === Iteration 437 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:26,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:26,338 INFO L82 PathProgramCache]: Analyzing trace with hash 9444079, now seen corresponding path program 430 times [2020-02-10 20:16:26,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:26,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565402352] [2020-02-10 20:16:26,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:26,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:26,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565402352] [2020-02-10 20:16:26,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:26,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:26,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024913904] [2020-02-10 20:16:26,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:26,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:26,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:26,760 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:26,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:26,882 INFO L93 Difference]: Finished difference Result 1481 states and 5126 transitions. [2020-02-10 20:16:26,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:26,882 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:26,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:26,886 INFO L225 Difference]: With dead ends: 1481 [2020-02-10 20:16:26,886 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:16:26,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:26,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:16:26,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 796. [2020-02-10 20:16:26,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:16:26,909 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:16:26,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:26,909 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:16:26,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:26,909 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:16:26,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:26,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:26,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:26,911 INFO L427 AbstractCegarLoop]: === Iteration 438 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:26,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:26,911 INFO L82 PathProgramCache]: Analyzing trace with hash -2107843145, now seen corresponding path program 431 times [2020-02-10 20:16:26,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:26,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343773044] [2020-02-10 20:16:26,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:27,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343773044] [2020-02-10 20:16:27,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:27,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:27,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615178939] [2020-02-10 20:16:27,332 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:27,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:27,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:27,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:27,332 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:16:27,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:27,467 INFO L93 Difference]: Finished difference Result 1475 states and 5114 transitions. [2020-02-10 20:16:27,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:27,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:27,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:27,472 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:16:27,472 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:16:27,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:27,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:16:27,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 20:16:27,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 20:16:27,509 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 20:16:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:27,509 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 20:16:27,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:27,509 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 20:16:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:27,512 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:27,512 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:27,512 INFO L427 AbstractCegarLoop]: === Iteration 439 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash -496902187, now seen corresponding path program 432 times [2020-02-10 20:16:27,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:27,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656356146] [2020-02-10 20:16:27,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:27,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:27,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:27,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656356146] [2020-02-10 20:16:27,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:27,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:27,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692819255] [2020-02-10 20:16:27,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:27,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:27,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:27,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:27,925 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:16:28,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,047 INFO L93 Difference]: Finished difference Result 1479 states and 5116 transitions. [2020-02-10 20:16:28,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:28,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:28,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,051 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:16:28,051 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:16:28,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:28,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:16:28,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 785. [2020-02-10 20:16:28,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:16:28,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3123 transitions. [2020-02-10 20:16:28,074 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3123 transitions. Word has length 25 [2020-02-10 20:16:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,074 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3123 transitions. [2020-02-10 20:16:28,074 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3123 transitions. [2020-02-10 20:16:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:28,075 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,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, 1, 1, 1] [2020-02-10 20:16:28,076 INFO L427 AbstractCegarLoop]: === Iteration 440 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,076 INFO L82 PathProgramCache]: Analyzing trace with hash -2039322317, now seen corresponding path program 433 times [2020-02-10 20:16:28,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432414477] [2020-02-10 20:16:28,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:28,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:28,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432414477] [2020-02-10 20:16:28,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:28,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:28,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521015112] [2020-02-10 20:16:28,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:28,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:28,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:28,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:28,478 INFO L87 Difference]: Start difference. First operand 785 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:16:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:28,644 INFO L93 Difference]: Finished difference Result 1464 states and 5108 transitions. [2020-02-10 20:16:28,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:28,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:28,648 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:16:28,648 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:16:28,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:28,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:16:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 799. [2020-02-10 20:16:28,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:28,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3171 transitions. [2020-02-10 20:16:28,671 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3171 transitions. Word has length 25 [2020-02-10 20:16:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:28,671 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3171 transitions. [2020-02-10 20:16:28,671 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:28,671 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3171 transitions. [2020-02-10 20:16:28,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:28,672 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:28,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, 1, 1, 1] [2020-02-10 20:16:28,672 INFO L427 AbstractCegarLoop]: === Iteration 441 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:28,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:28,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1048064495, now seen corresponding path program 434 times [2020-02-10 20:16:28,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:28,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092013358] [2020-02-10 20:16:28,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:28,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092013358] [2020-02-10 20:16:29,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:29,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058406277] [2020-02-10 20:16:29,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:29,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:29,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:29,071 INFO L87 Difference]: Start difference. First operand 799 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:16:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,239 INFO L93 Difference]: Finished difference Result 1467 states and 5110 transitions. [2020-02-10 20:16:29,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:29,239 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:29,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,243 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:16:29,243 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:16:29,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:29,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:16:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 795. [2020-02-10 20:16:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:29,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3160 transitions. [2020-02-10 20:16:29,266 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3160 transitions. Word has length 25 [2020-02-10 20:16:29,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,267 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3160 transitions. [2020-02-10 20:16:29,267 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:29,267 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3160 transitions. [2020-02-10 20:16:29,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:29,268 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,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, 1, 1, 1] [2020-02-10 20:16:29,268 INFO L427 AbstractCegarLoop]: === Iteration 442 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,268 INFO L82 PathProgramCache]: Analyzing trace with hash -113288239, now seen corresponding path program 435 times [2020-02-10 20:16:29,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304896719] [2020-02-10 20:16:29,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:29,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304896719] [2020-02-10 20:16:29,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:29,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:29,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814418308] [2020-02-10 20:16:29,678 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:29,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:29,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:29,678 INFO L87 Difference]: Start difference. First operand 795 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:16:29,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:29,854 INFO L93 Difference]: Finished difference Result 1462 states and 5100 transitions. [2020-02-10 20:16:29,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:29,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:29,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:29,858 INFO L225 Difference]: With dead ends: 1462 [2020-02-10 20:16:29,858 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:16:29,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:29,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:16:29,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 799. [2020-02-10 20:16:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3167 transitions. [2020-02-10 20:16:29,882 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:29,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:29,882 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3167 transitions. [2020-02-10 20:16:29,882 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:29,882 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3167 transitions. [2020-02-10 20:16:29,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:29,883 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:29,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, 1, 1, 1] [2020-02-10 20:16:29,883 INFO L427 AbstractCegarLoop]: === Iteration 443 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:29,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:29,884 INFO L82 PathProgramCache]: Analyzing trace with hash 888472687, now seen corresponding path program 436 times [2020-02-10 20:16:29,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:29,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542147488] [2020-02-10 20:16:29,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:29,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:30,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:30,285 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542147488] [2020-02-10 20:16:30,285 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:30,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:30,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57486103] [2020-02-10 20:16:30,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:30,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:30,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:30,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:30,286 INFO L87 Difference]: Start difference. First operand 799 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:30,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:30,467 INFO L93 Difference]: Finished difference Result 1463 states and 5098 transitions. [2020-02-10 20:16:30,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:30,468 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:30,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:30,471 INFO L225 Difference]: With dead ends: 1463 [2020-02-10 20:16:30,471 INFO L226 Difference]: Without dead ends: 1445 [2020-02-10 20:16:30,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2020-02-10 20:16:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 795. [2020-02-10 20:16:30,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:16:30,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3156 transitions. [2020-02-10 20:16:30,494 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3156 transitions. Word has length 25 [2020-02-10 20:16:30,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:30,494 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3156 transitions. [2020-02-10 20:16:30,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3156 transitions. [2020-02-10 20:16:30,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:30,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:30,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, 1, 1, 1] [2020-02-10 20:16:30,495 INFO L427 AbstractCegarLoop]: === Iteration 444 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:30,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:30,495 INFO L82 PathProgramCache]: Analyzing trace with hash -58246861, now seen corresponding path program 437 times [2020-02-10 20:16:30,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:30,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810381330] [2020-02-10 20:16:30,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:30,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 20:16:30,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810381330] [2020-02-10 20:16:30,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:30,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:30,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485217809] [2020-02-10 20:16:30,899 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:30,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:30,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:30,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:30,899 INFO L87 Difference]: Start difference. First operand 795 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:16:31,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,038 INFO L93 Difference]: Finished difference Result 1469 states and 5111 transitions. [2020-02-10 20:16:31,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:31,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:31,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,042 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:16:31,043 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:16:31,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:31,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:16:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 800. [2020-02-10 20:16:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:31,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3165 transitions. [2020-02-10 20:16:31,065 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3165 transitions. Word has length 25 [2020-02-10 20:16:31,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,065 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3165 transitions. [2020-02-10 20:16:31,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:31,065 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3165 transitions. [2020-02-10 20:16:31,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:31,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,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, 1, 1, 1] [2020-02-10 20:16:31,066 INFO L427 AbstractCegarLoop]: === Iteration 445 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1552694097, now seen corresponding path program 438 times [2020-02-10 20:16:31,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351296580] [2020-02-10 20:16:31,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16: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 20:16:31,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351296580] [2020-02-10 20:16:31,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:31,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:31,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506794745] [2020-02-10 20:16:31,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:31,466 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:31,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:31,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:31,466 INFO L87 Difference]: Start difference. First operand 800 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:16:31,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:31,636 INFO L93 Difference]: Finished difference Result 1467 states and 5102 transitions. [2020-02-10 20:16:31,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:31,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:31,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:31,640 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:16:31,640 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:16:31,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:16:31,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 791. [2020-02-10 20:16:31,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:16:31,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:16:31,663 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:16:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:31,663 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:16:31,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:16:31,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:31,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:31,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, 1, 1, 1] [2020-02-10 20:16:31,664 INFO L427 AbstractCegarLoop]: === Iteration 446 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:31,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1833159253, now seen corresponding path program 439 times [2020-02-10 20:16:31,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:31,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411275353] [2020-02-10 20:16:31,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:31,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411275353] [2020-02-10 20:16:32,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:32,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131534200] [2020-02-10 20:16:32,065 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:32,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:32,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:32,065 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:16:32,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,212 INFO L93 Difference]: Finished difference Result 1475 states and 5127 transitions. [2020-02-10 20:16:32,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:32,212 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:32,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,216 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:16:32,216 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:16:32,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:32,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:16:32,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 801. [2020-02-10 20:16:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:32,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3172 transitions. [2020-02-10 20:16:32,239 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3172 transitions. Word has length 25 [2020-02-10 20:16:32,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,239 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3172 transitions. [2020-02-10 20:16:32,239 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:32,239 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3172 transitions. [2020-02-10 20:16:32,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:32,240 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,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, 1, 1, 1] [2020-02-10 20:16:32,240 INFO L427 AbstractCegarLoop]: === Iteration 447 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1470550221, now seen corresponding path program 440 times [2020-02-10 20:16:32,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914637586] [2020-02-10 20:16:32,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:32,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:32,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914637586] [2020-02-10 20:16:32,640 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:32,640 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:32,640 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785162205] [2020-02-10 20:16:32,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:32,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:32,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:32,641 INFO L87 Difference]: Start difference. First operand 801 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:16:32,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:32,784 INFO L93 Difference]: Finished difference Result 1478 states and 5129 transitions. [2020-02-10 20:16:32,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:32,785 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:32,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:32,788 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:16:32,789 INFO L226 Difference]: Without dead ends: 1458 [2020-02-10 20:16:32,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1458 states. [2020-02-10 20:16:32,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1458 to 797. [2020-02-10 20:16:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:16:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3161 transitions. [2020-02-10 20:16:32,811 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3161 transitions. Word has length 25 [2020-02-10 20:16:32,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:32,812 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3161 transitions. [2020-02-10 20:16:32,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:32,812 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3161 transitions. [2020-02-10 20:16:32,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:32,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:32,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, 1, 1, 1] [2020-02-10 20:16:32,813 INFO L427 AbstractCegarLoop]: === Iteration 448 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:32,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:32,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1390260113, now seen corresponding path program 441 times [2020-02-10 20:16:32,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:32,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443117911] [2020-02-10 20:16:32,813 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:32,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,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 20:16:33,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443117911] [2020-02-10 20:16:33,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:33,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683033660] [2020-02-10 20:16:33,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:33,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:33,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:33,224 INFO L87 Difference]: Start difference. First operand 797 states and 3161 transitions. Second operand 10 states. [2020-02-10 20:16:33,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:33,407 INFO L93 Difference]: Finished difference Result 1478 states and 5128 transitions. [2020-02-10 20:16:33,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:33,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:33,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:33,412 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:16:33,412 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:16:33,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:33,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:16:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 802. [2020-02-10 20:16:33,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3170 transitions. [2020-02-10 20:16:33,444 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3170 transitions. Word has length 25 [2020-02-10 20:16:33,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:33,444 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3170 transitions. [2020-02-10 20:16:33,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:33,444 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3170 transitions. [2020-02-10 20:16:33,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:33,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:33,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, 1, 1, 1] [2020-02-10 20:16:33,446 INFO L427 AbstractCegarLoop]: === Iteration 449 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:33,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:33,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1892443153, now seen corresponding path program 442 times [2020-02-10 20:16:33,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:33,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196729966] [2020-02-10 20:16:33,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:33,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:33,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:33,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196729966] [2020-02-10 20:16:33,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:33,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:33,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405173276] [2020-02-10 20:16:33,858 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:33,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:33,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:33,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:33,858 INFO L87 Difference]: Start difference. First operand 802 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:16:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:33,977 INFO L93 Difference]: Finished difference Result 1483 states and 5133 transitions. [2020-02-10 20:16:33,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:33,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:33,981 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:16:33,981 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:16:33,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:33,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:16:34,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 797. [2020-02-10 20:16:34,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:16:34,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 20:16:34,004 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 20:16:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,004 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 20:16:34,004 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:34,004 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 20:16:34,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:34,005 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,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, 1, 1, 1] [2020-02-10 20:16:34,005 INFO L427 AbstractCegarLoop]: === Iteration 450 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,006 INFO L82 PathProgramCache]: Analyzing trace with hash -155136363, now seen corresponding path program 443 times [2020-02-10 20:16:34,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667887207] [2020-02-10 20:16:34,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:34,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:34,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667887207] [2020-02-10 20:16:34,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:34,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:34,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533573490] [2020-02-10 20:16:34,423 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:34,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:34,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:34,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:34,423 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:16:34,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:34,572 INFO L93 Difference]: Finished difference Result 1488 states and 5145 transitions. [2020-02-10 20:16:34,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:34,572 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:34,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:34,576 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:16:34,576 INFO L226 Difference]: Without dead ends: 1472 [2020-02-10 20:16:34,577 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:34,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2020-02-10 20:16:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 806. [2020-02-10 20:16:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:16:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3172 transitions. [2020-02-10 20:16:34,599 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3172 transitions. Word has length 25 [2020-02-10 20:16:34,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:34,600 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3172 transitions. [2020-02-10 20:16:34,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3172 transitions. [2020-02-10 20:16:34,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:34,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:34,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, 1, 1, 1] [2020-02-10 20:16:34,601 INFO L427 AbstractCegarLoop]: === Iteration 451 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:34,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:34,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1228221743, now seen corresponding path program 444 times [2020-02-10 20:16:34,601 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:34,601 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120463349] [2020-02-10 20:16:34,601 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120463349] [2020-02-10 20:16:35,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:35,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204110465] [2020-02-10 20:16:35,026 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:35,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:35,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:35,026 INFO L87 Difference]: Start difference. First operand 806 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:16:35,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,173 INFO L93 Difference]: Finished difference Result 1490 states and 5141 transitions. [2020-02-10 20:16:35,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:35,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:35,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,177 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:16:35,177 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:16:35,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:16:35,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 791. [2020-02-10 20:16:35,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:16:35,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 20:16:35,201 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 20:16:35,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,201 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 20:16:35,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:35,202 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 20:16:35,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:35,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,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, 1, 1, 1] [2020-02-10 20:16:35,203 INFO L427 AbstractCegarLoop]: === Iteration 452 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,203 INFO L82 PathProgramCache]: Analyzing trace with hash -958259691, now seen corresponding path program 445 times [2020-02-10 20:16:35,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110252815] [2020-02-10 20:16:35,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:35,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:35,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110252815] [2020-02-10 20:16:35,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:35,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:35,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723038445] [2020-02-10 20:16:35,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:35,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:35,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:35,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:35,638 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:16:35,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:35,807 INFO L93 Difference]: Finished difference Result 1467 states and 5104 transitions. [2020-02-10 20:16:35,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:35,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:35,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:35,811 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:16:35,811 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:16:35,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:35,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:16:35,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 800. [2020-02-10 20:16:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:35,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3164 transitions. [2020-02-10 20:16:35,834 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3164 transitions. Word has length 25 [2020-02-10 20:16:35,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:35,834 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3164 transitions. [2020-02-10 20:16:35,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:35,834 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3164 transitions. [2020-02-10 20:16:35,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:35,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:35,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, 1, 1, 1] [2020-02-10 20:16:35,836 INFO L427 AbstractCegarLoop]: === Iteration 453 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:35,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:35,836 INFO L82 PathProgramCache]: Analyzing trace with hash 43501235, now seen corresponding path program 446 times [2020-02-10 20:16:35,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:35,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662307691] [2020-02-10 20:16:35,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:36,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662307691] [2020-02-10 20:16:36,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:36,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:36,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742367336] [2020-02-10 20:16:36,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:36,247 INFO L87 Difference]: Start difference. First operand 800 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:16:36,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,402 INFO L93 Difference]: Finished difference Result 1468 states and 5102 transitions. [2020-02-10 20:16:36,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:36,403 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:36,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:36,406 INFO L225 Difference]: With dead ends: 1468 [2020-02-10 20:16:36,406 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:16:36,407 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:36,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:16:36,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 796. [2020-02-10 20:16:36,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:36,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3153 transitions. [2020-02-10 20:16:36,429 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3153 transitions. Word has length 25 [2020-02-10 20:16:36,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:36,429 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3153 transitions. [2020-02-10 20:16:36,429 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:36,429 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3153 transitions. [2020-02-10 20:16:36,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:36,430 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:36,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, 1, 1, 1] [2020-02-10 20:16:36,430 INFO L427 AbstractCegarLoop]: === Iteration 454 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:36,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:36,430 INFO L82 PathProgramCache]: Analyzing trace with hash 967774387, now seen corresponding path program 447 times [2020-02-10 20:16:36,430 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:36,430 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083961574] [2020-02-10 20:16:36,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:36,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:36,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:36,837 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083961574] [2020-02-10 20:16:36,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:36,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:36,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625978125] [2020-02-10 20:16:36,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:36,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:36,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:36,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:36,838 INFO L87 Difference]: Start difference. First operand 796 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:16:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:36,995 INFO L93 Difference]: Finished difference Result 1472 states and 5109 transitions. [2020-02-10 20:16:36,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:36,996 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,000 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:16:37,000 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:16:37,000 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:16:37,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 801. [2020-02-10 20:16:37,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:37,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3162 transitions. [2020-02-10 20:16:37,022 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3162 transitions. Word has length 25 [2020-02-10 20:16:37,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,023 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3162 transitions. [2020-02-10 20:16:37,023 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:37,023 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3162 transitions. [2020-02-10 20:16:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:37,024 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,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, 1, 1, 1] [2020-02-10 20:16:37,024 INFO L427 AbstractCegarLoop]: === Iteration 455 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,024 INFO L82 PathProgramCache]: Analyzing trace with hash 1980038417, now seen corresponding path program 448 times [2020-02-10 20:16:37,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231143627] [2020-02-10 20:16:37,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:37,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231143627] [2020-02-10 20:16:37,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:37,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:37,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550100133] [2020-02-10 20:16:37,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:37,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:37,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:37,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:37,442 INFO L87 Difference]: Start difference. First operand 801 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:16:37,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:37,596 INFO L93 Difference]: Finished difference Result 1477 states and 5114 transitions. [2020-02-10 20:16:37,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:37,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:37,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:37,599 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:16:37,600 INFO L226 Difference]: Without dead ends: 1454 [2020-02-10 20:16:37,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:37,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2020-02-10 20:16:37,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 796. [2020-02-10 20:16:37,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:16:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:16:37,622 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:16:37,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:37,622 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:16:37,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:37,622 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:16:37,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:37,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:37,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, 1, 1, 1] [2020-02-10 20:16:37,623 INFO L427 AbstractCegarLoop]: === Iteration 456 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:37,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1358915093, now seen corresponding path program 449 times [2020-02-10 20:16:37,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:37,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462908090] [2020-02-10 20:16:37,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462908090] [2020-02-10 20:16:38,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:38,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603566502] [2020-02-10 20:16:38,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:38,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:38,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:38,039 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:16:38,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:38,209 INFO L93 Difference]: Finished difference Result 1475 states and 5111 transitions. [2020-02-10 20:16:38,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:38,209 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:38,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:38,213 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:16:38,213 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:16:38,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:16:38,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 802. [2020-02-10 20:16:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:16:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3159 transitions. [2020-02-10 20:16:38,236 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3159 transitions. Word has length 25 [2020-02-10 20:16:38,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:38,236 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3159 transitions. [2020-02-10 20:16:38,236 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:38,236 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3159 transitions. [2020-02-10 20:16:38,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:38,237 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:38,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, 1, 1, 1] [2020-02-10 20:16:38,237 INFO L427 AbstractCegarLoop]: === Iteration 457 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:38,237 INFO L82 PathProgramCache]: Analyzing trace with hash -1325111245, now seen corresponding path program 450 times [2020-02-10 20:16:38,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:38,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719575343] [2020-02-10 20:16:38,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:38,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:38,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719575343] [2020-02-10 20:16:38,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:38,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:38,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83234885] [2020-02-10 20:16:38,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:38,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:38,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:38,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:38,662 INFO L87 Difference]: Start difference. First operand 802 states and 3159 transitions. Second operand 10 states. [2020-02-10 20:16:38,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:38,817 INFO L93 Difference]: Finished difference Result 1479 states and 5113 transitions. [2020-02-10 20:16:38,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:38,817 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:38,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:38,821 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:16:38,821 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:16:38,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:38,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:16:38,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 791. [2020-02-10 20:16:38,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:16:38,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 20:16:38,844 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 20:16:38,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:38,844 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 20:16:38,844 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:38,844 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 20:16:38,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:38,845 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:38,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, 1, 1, 1] [2020-02-10 20:16:38,845 INFO L427 AbstractCegarLoop]: === Iteration 458 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:38,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:38,845 INFO L82 PathProgramCache]: Analyzing trace with hash 2064877073, now seen corresponding path program 451 times [2020-02-10 20:16:38,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:38,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457866339] [2020-02-10 20:16:38,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:38,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:39,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:39,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457866339] [2020-02-10 20:16:39,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:39,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109554358] [2020-02-10 20:16:39,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:39,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:39,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:39,267 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:16:39,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:39,430 INFO L93 Difference]: Finished difference Result 1484 states and 5139 transitions. [2020-02-10 20:16:39,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:39,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:39,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:39,434 INFO L225 Difference]: With dead ends: 1484 [2020-02-10 20:16:39,435 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:16:39,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:16:39,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 803. [2020-02-10 20:16:39,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:16:39,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3167 transitions. [2020-02-10 20:16:39,458 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:39,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:39,458 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3167 transitions. [2020-02-10 20:16:39,458 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:39,458 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3167 transitions. [2020-02-10 20:16:39,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:39,459 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:39,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, 1, 1, 1] [2020-02-10 20:16:39,459 INFO L427 AbstractCegarLoop]: === Iteration 459 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:39,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:39,459 INFO L82 PathProgramCache]: Analyzing trace with hash -619149265, now seen corresponding path program 452 times [2020-02-10 20:16:39,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:39,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836523812] [2020-02-10 20:16:39,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16: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 20:16:39,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836523812] [2020-02-10 20:16:39,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:39,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:39,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440875308] [2020-02-10 20:16:39,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:39,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:39,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:39,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:39,863 INFO L87 Difference]: Start difference. First operand 803 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,033 INFO L93 Difference]: Finished difference Result 1482 states and 5130 transitions. [2020-02-10 20:16:40,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:40,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:40,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,037 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:16:40,037 INFO L226 Difference]: Without dead ends: 1463 [2020-02-10 20:16:40,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:40,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1463 states. [2020-02-10 20:16:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1463 to 798. [2020-02-10 20:16:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:40,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3153 transitions. [2020-02-10 20:16:40,060 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3153 transitions. Word has length 25 [2020-02-10 20:16:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,060 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3153 transitions. [2020-02-10 20:16:40,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3153 transitions. [2020-02-10 20:16:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:40,061 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,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, 1, 1, 1] [2020-02-10 20:16:40,061 INFO L427 AbstractCegarLoop]: === Iteration 460 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,061 INFO L82 PathProgramCache]: Analyzing trace with hash 464439219, now seen corresponding path program 453 times [2020-02-10 20:16:40,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512567820] [2020-02-10 20:16:40,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:40,472 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512567820] [2020-02-10 20:16:40,472 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:40,472 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:40,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584059886] [2020-02-10 20:16:40,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:40,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:40,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:40,473 INFO L87 Difference]: Start difference. First operand 798 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:16:40,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:40,636 INFO L93 Difference]: Finished difference Result 1492 states and 5150 transitions. [2020-02-10 20:16:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:40,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:40,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:40,641 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:16:40,641 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:16:40,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:16:40,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 807. [2020-02-10 20:16:40,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:16:40,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3169 transitions. [2020-02-10 20:16:40,664 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:40,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:40,664 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3169 transitions. [2020-02-10 20:16:40,664 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:40,664 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3169 transitions. [2020-02-10 20:16:40,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:40,665 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:40,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, 1, 1, 1] [2020-02-10 20:16:40,665 INFO L427 AbstractCegarLoop]: === Iteration 461 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:40,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:40,665 INFO L82 PathProgramCache]: Analyzing trace with hash -608646161, now seen corresponding path program 454 times [2020-02-10 20:16:40,665 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:40,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727543447] [2020-02-10 20:16:40,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:40,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:41,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 20:16:41,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727543447] [2020-02-10 20:16:41,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:41,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:41,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176948502] [2020-02-10 20:16:41,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:41,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:41,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:41,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:41,079 INFO L87 Difference]: Start difference. First operand 807 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:41,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,219 INFO L93 Difference]: Finished difference Result 1494 states and 5146 transitions. [2020-02-10 20:16:41,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:41,220 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:41,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,223 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:16:41,224 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:16:41,224 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:41,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:16:41,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 798. [2020-02-10 20:16:41,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:16:41,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 20:16:41,246 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 20:16:41,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,247 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 20:16:41,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:41,247 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 20:16:41,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:41,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,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, 1, 1, 1] [2020-02-10 20:16:41,248 INFO L427 AbstractCegarLoop]: === Iteration 462 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,248 INFO L82 PathProgramCache]: Analyzing trace with hash 474942323, now seen corresponding path program 455 times [2020-02-10 20:16:41,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522447320] [2020-02-10 20:16:41,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:41,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522447320] [2020-02-10 20:16:41,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:41,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:41,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715697496] [2020-02-10 20:16:41,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:41,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:41,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:41,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:41,660 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:16:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:41,836 INFO L93 Difference]: Finished difference Result 1485 states and 5128 transitions. [2020-02-10 20:16:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:41,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:41,840 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:16:41,840 INFO L226 Difference]: Without dead ends: 1471 [2020-02-10 20:16:41,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2020-02-10 20:16:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 804. [2020-02-10 20:16:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:16:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3157 transitions. [2020-02-10 20:16:41,862 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3157 transitions. Word has length 25 [2020-02-10 20:16:41,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:41,863 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3157 transitions. [2020-02-10 20:16:41,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:41,863 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3157 transitions. [2020-02-10 20:16:41,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:41,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:41,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, 1, 1, 1] [2020-02-10 20:16:41,864 INFO L427 AbstractCegarLoop]: === Iteration 463 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:41,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:41,864 INFO L82 PathProgramCache]: Analyzing trace with hash 2085883281, now seen corresponding path program 456 times [2020-02-10 20:16:41,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:41,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243678793] [2020-02-10 20:16:41,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,283 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243678793] [2020-02-10 20:16:42,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:42,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156769050] [2020-02-10 20:16:42,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:42,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:42,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:42,284 INFO L87 Difference]: Start difference. First operand 804 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:16:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:42,420 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 20:16:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:42,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:42,424 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:16:42,424 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:16:42,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:42,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:16:42,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 785. [2020-02-10 20:16:42,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:16:42,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3117 transitions. [2020-02-10 20:16:42,447 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3117 transitions. Word has length 25 [2020-02-10 20:16:42,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:42,447 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3117 transitions. [2020-02-10 20:16:42,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3117 transitions. [2020-02-10 20:16:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:42,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:42,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, 1, 1, 1] [2020-02-10 20:16:42,448 INFO L427 AbstractCegarLoop]: === Iteration 464 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:42,448 INFO L82 PathProgramCache]: Analyzing trace with hash -128929703, now seen corresponding path program 457 times [2020-02-10 20:16:42,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:42,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807891053] [2020-02-10 20:16:42,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:42,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:42,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:42,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807891053] [2020-02-10 20:16:42,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:42,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:42,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247871739] [2020-02-10 20:16:42,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:42,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:42,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:42,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:42,878 INFO L87 Difference]: Start difference. First operand 785 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:16:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,045 INFO L93 Difference]: Finished difference Result 1491 states and 5177 transitions. [2020-02-10 20:16:43,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:43,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:43,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,049 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 20:16:43,049 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:16:43,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:43,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:16:43,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 805. [2020-02-10 20:16:43,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:16:43,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3181 transitions. [2020-02-10 20:16:43,072 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3181 transitions. Word has length 25 [2020-02-10 20:16:43,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,072 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3181 transitions. [2020-02-10 20:16:43,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:43,072 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3181 transitions. [2020-02-10 20:16:43,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:43,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,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, 1, 1, 1] [2020-02-10 20:16:43,074 INFO L427 AbstractCegarLoop]: === Iteration 465 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1202015083, now seen corresponding path program 458 times [2020-02-10 20:16:43,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081296717] [2020-02-10 20:16:43,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:43,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:43,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081296717] [2020-02-10 20:16:43,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:43,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:43,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969417134] [2020-02-10 20:16:43,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:43,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:43,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:43,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:43,568 INFO L87 Difference]: Start difference. First operand 805 states and 3181 transitions. Second operand 10 states. [2020-02-10 20:16:43,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:43,717 INFO L93 Difference]: Finished difference Result 1492 states and 5173 transitions. [2020-02-10 20:16:43,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:43,718 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:43,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:43,722 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:16:43,722 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 20:16:43,722 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 20:16:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 799. [2020-02-10 20:16:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:43,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3165 transitions. [2020-02-10 20:16:43,744 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3165 transitions. Word has length 25 [2020-02-10 20:16:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:43,744 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3165 transitions. [2020-02-10 20:16:43,744 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3165 transitions. [2020-02-10 20:16:43,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:43,745 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:43,745 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:43,745 INFO L427 AbstractCegarLoop]: === Iteration 466 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:43,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:43,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1729367557, now seen corresponding path program 459 times [2020-02-10 20:16:43,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:43,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998495579] [2020-02-10 20:16:43,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,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 20:16:44,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998495579] [2020-02-10 20:16:44,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:44,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745258370] [2020-02-10 20:16:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:44,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:44,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:44,157 INFO L87 Difference]: Start difference. First operand 799 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:16:44,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:44,309 INFO L93 Difference]: Finished difference Result 1488 states and 5165 transitions. [2020-02-10 20:16:44,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:44,310 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:44,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:44,313 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:16:44,314 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:16:44,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:16:44,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 804. [2020-02-10 20:16:44,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:16:44,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3174 transitions. [2020-02-10 20:16:44,336 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3174 transitions. Word has length 25 [2020-02-10 20:16:44,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:44,337 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3174 transitions. [2020-02-10 20:16:44,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:44,337 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3174 transitions. [2020-02-10 20:16:44,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:44,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:44,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:44,338 INFO L427 AbstractCegarLoop]: === Iteration 467 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:44,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:44,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1191511979, now seen corresponding path program 460 times [2020-02-10 20:16:44,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:44,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660212817] [2020-02-10 20:16:44,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:44,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:44,749 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660212817] [2020-02-10 20:16:44,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:44,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:44,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692861876] [2020-02-10 20:16:44,750 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:44,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:44,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:44,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:44,750 INFO L87 Difference]: Start difference. First operand 804 states and 3174 transitions. Second operand 10 states. [2020-02-10 20:16:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:44,891 INFO L93 Difference]: Finished difference Result 1487 states and 5158 transitions. [2020-02-10 20:16:44,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:44,891 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:44,895 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 20:16:44,895 INFO L226 Difference]: Without dead ends: 1468 [2020-02-10 20:16:44,895 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:44,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1468 states. [2020-02-10 20:16:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1468 to 799. [2020-02-10 20:16:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:16:44,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3160 transitions. [2020-02-10 20:16:44,918 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3160 transitions. Word has length 25 [2020-02-10 20:16:44,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:44,918 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3160 transitions. [2020-02-10 20:16:44,918 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:44,918 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3160 transitions. [2020-02-10 20:16:44,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:44,919 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:44,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, 1, 1, 1] [2020-02-10 20:16:44,919 INFO L427 AbstractCegarLoop]: === Iteration 468 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:44,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:44,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1708361349, now seen corresponding path program 461 times [2020-02-10 20:16:44,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:44,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210679516] [2020-02-10 20:16:44,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:44,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:45,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:45,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210679516] [2020-02-10 20:16:45,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:45,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:45,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039497296] [2020-02-10 20:16:45,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:45,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:45,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:45,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:45,329 INFO L87 Difference]: Start difference. First operand 799 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:16:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:45,494 INFO L93 Difference]: Finished difference Result 1490 states and 5164 transitions. [2020-02-10 20:16:45,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:45,494 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:45,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:45,498 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:16:45,498 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 20:16:45,499 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:45,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 20:16:45,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 804. [2020-02-10 20:16:45,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:16:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3169 transitions. [2020-02-10 20:16:45,521 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:45,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:45,522 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3169 transitions. [2020-02-10 20:16:45,522 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3169 transitions. [2020-02-10 20:16:45,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:45,523 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:45,523 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:45,523 INFO L427 AbstractCegarLoop]: === Iteration 469 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:45,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:45,523 INFO L82 PathProgramCache]: Analyzing trace with hash -97420391, now seen corresponding path program 462 times [2020-02-10 20:16:45,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:45,523 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991341938] [2020-02-10 20:16:45,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:45,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:45,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:45,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991341938] [2020-02-10 20:16:45,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:45,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:45,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743680148] [2020-02-10 20:16:45,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:45,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:45,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:45,935 INFO L87 Difference]: Start difference. First operand 804 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:46,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,083 INFO L93 Difference]: Finished difference Result 1488 states and 5155 transitions. [2020-02-10 20:16:46,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:46,083 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:46,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,087 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:16:46,087 INFO L226 Difference]: Without dead ends: 1464 [2020-02-10 20:16:46,087 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1464 states. [2020-02-10 20:16:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1464 to 794. [2020-02-10 20:16:46,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:16:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:16:46,109 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:16:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:46,109 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:16:46,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:46,109 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:16:46,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:46,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:46,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, 1, 1, 1] [2020-02-10 20:16:46,110 INFO L427 AbstractCegarLoop]: === Iteration 470 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:46,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:46,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1797104375, now seen corresponding path program 463 times [2020-02-10 20:16:46,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:46,111 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126248755] [2020-02-10 20:16:46,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:46,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:46,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126248755] [2020-02-10 20:16:46,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:46,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:46,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658279487] [2020-02-10 20:16:46,550 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:46,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:46,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:46,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:46,550 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:16:46,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:46,697 INFO L93 Difference]: Finished difference Result 1505 states and 5203 transitions. [2020-02-10 20:16:46,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:46,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:46,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:46,701 INFO L225 Difference]: With dead ends: 1505 [2020-02-10 20:16:46,701 INFO L226 Difference]: Without dead ends: 1490 [2020-02-10 20:16:46,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:46,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1490 states. [2020-02-10 20:16:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1490 to 809. [2020-02-10 20:16:46,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2020-02-10 20:16:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 3186 transitions. [2020-02-10 20:16:46,724 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 3186 transitions. Word has length 25 [2020-02-10 20:16:46,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:46,724 INFO L479 AbstractCegarLoop]: Abstraction has 809 states and 3186 transitions. [2020-02-10 20:16:46,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 3186 transitions. [2020-02-10 20:16:46,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:46,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:46,725 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:46,725 INFO L427 AbstractCegarLoop]: === Iteration 471 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash 724018995, now seen corresponding path program 464 times [2020-02-10 20:16:46,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408665900] [2020-02-10 20:16:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408665900] [2020-02-10 20:16:47,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:47,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849537245] [2020-02-10 20:16:47,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:47,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:47,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:47,156 INFO L87 Difference]: Start difference. First operand 809 states and 3186 transitions. Second operand 10 states. [2020-02-10 20:16:47,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,314 INFO L93 Difference]: Finished difference Result 1506 states and 5199 transitions. [2020-02-10 20:16:47,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:47,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:47,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,319 INFO L225 Difference]: With dead ends: 1506 [2020-02-10 20:16:47,319 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:16:47,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:47,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:16:47,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 803. [2020-02-10 20:16:47,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:16:47,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3169 transitions. [2020-02-10 20:16:47,342 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,342 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3169 transitions. [2020-02-10 20:16:47,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3169 transitions. [2020-02-10 20:16:47,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:47,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,343 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:47,344 INFO L427 AbstractCegarLoop]: === Iteration 472 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,344 INFO L82 PathProgramCache]: Analyzing trace with hash -1403771333, now seen corresponding path program 465 times [2020-02-10 20:16:47,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541876770] [2020-02-10 20:16:47,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:47,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:47,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541876770] [2020-02-10 20:16:47,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:47,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:47,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590730805] [2020-02-10 20:16:47,759 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:47,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:47,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:47,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:47,759 INFO L87 Difference]: Start difference. First operand 803 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:47,896 INFO L93 Difference]: Finished difference Result 1508 states and 5202 transitions. [2020-02-10 20:16:47,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:47,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:47,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:47,900 INFO L225 Difference]: With dead ends: 1508 [2020-02-10 20:16:47,900 INFO L226 Difference]: Without dead ends: 1493 [2020-02-10 20:16:47,900 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:47,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2020-02-10 20:16:47,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 810. [2020-02-10 20:16:47,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:16:47,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3182 transitions. [2020-02-10 20:16:47,923 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3182 transitions. Word has length 25 [2020-02-10 20:16:47,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:47,923 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3182 transitions. [2020-02-10 20:16:47,923 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:47,923 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3182 transitions. [2020-02-10 20:16:47,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:47,924 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:47,924 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:47,924 INFO L427 AbstractCegarLoop]: === Iteration 473 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:47,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:47,925 INFO L82 PathProgramCache]: Analyzing trace with hash 745025203, now seen corresponding path program 466 times [2020-02-10 20:16:47,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:47,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111819794] [2020-02-10 20:16:47,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,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 20:16:48,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111819794] [2020-02-10 20:16:48,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:48,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138613504] [2020-02-10 20:16:48,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:48,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:48,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:48,349 INFO L87 Difference]: Start difference. First operand 810 states and 3182 transitions. Second operand 10 states. [2020-02-10 20:16:48,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:48,484 INFO L93 Difference]: Finished difference Result 1511 states and 5201 transitions. [2020-02-10 20:16:48,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:48,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:48,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:48,488 INFO L225 Difference]: With dead ends: 1511 [2020-02-10 20:16:48,488 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 20:16:48,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:48,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 20:16:48,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 803. [2020-02-10 20:16:48,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:16:48,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3162 transitions. [2020-02-10 20:16:48,510 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3162 transitions. Word has length 25 [2020-02-10 20:16:48,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:48,510 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3162 transitions. [2020-02-10 20:16:48,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:48,510 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3162 transitions. [2020-02-10 20:16:48,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:48,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:48,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, 1, 1, 1] [2020-02-10 20:16:48,512 INFO L427 AbstractCegarLoop]: === Iteration 474 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:48,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:48,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1382765125, now seen corresponding path program 467 times [2020-02-10 20:16:48,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:48,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629919513] [2020-02-10 20:16:48,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:48,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:48,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:48,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629919513] [2020-02-10 20:16:48,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:48,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:48,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764820951] [2020-02-10 20:16:48,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:48,934 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:48,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:48,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:48,934 INFO L87 Difference]: Start difference. First operand 803 states and 3162 transitions. Second operand 10 states. [2020-02-10 20:16:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,078 INFO L93 Difference]: Finished difference Result 1512 states and 5203 transitions. [2020-02-10 20:16:49,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:49,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:49,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,083 INFO L225 Difference]: With dead ends: 1512 [2020-02-10 20:16:49,083 INFO L226 Difference]: Without dead ends: 1496 [2020-02-10 20:16:49,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:49,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states. [2020-02-10 20:16:49,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 812. [2020-02-10 20:16:49,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 812 states. [2020-02-10 20:16:49,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 3178 transitions. [2020-02-10 20:16:49,106 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 3178 transitions. Word has length 25 [2020-02-10 20:16:49,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,106 INFO L479 AbstractCegarLoop]: Abstraction has 812 states and 3178 transitions. [2020-02-10 20:16:49,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:49,107 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 3178 transitions. [2020-02-10 20:16:49,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:49,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,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, 1, 1, 1] [2020-02-10 20:16:49,108 INFO L427 AbstractCegarLoop]: === Iteration 475 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1839116791, now seen corresponding path program 468 times [2020-02-10 20:16:49,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752128595] [2020-02-10 20:16:49,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:49,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:49,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752128595] [2020-02-10 20:16:49,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:49,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:49,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091804075] [2020-02-10 20:16:49,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:49,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:49,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:49,541 INFO L87 Difference]: Start difference. First operand 812 states and 3178 transitions. Second operand 10 states. [2020-02-10 20:16:49,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:49,686 INFO L93 Difference]: Finished difference Result 1514 states and 5199 transitions. [2020-02-10 20:16:49,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:49,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:49,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:49,690 INFO L225 Difference]: With dead ends: 1514 [2020-02-10 20:16:49,691 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:16:49,691 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:49,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:16:49,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 794. [2020-02-10 20:16:49,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:16:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 20:16:49,713 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 20:16:49,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:49,713 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 20:16:49,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:49,713 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 20:16:49,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:49,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:49,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, 1, 1, 1] [2020-02-10 20:16:49,715 INFO L427 AbstractCegarLoop]: === Iteration 476 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:49,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:49,715 INFO L82 PathProgramCache]: Analyzing trace with hash 2122700599, now seen corresponding path program 469 times [2020-02-10 20:16:49,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:49,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158867635] [2020-02-10 20:16:49,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:49,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:50,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:50,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158867635] [2020-02-10 20:16:50,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:50,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:50,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680615858] [2020-02-10 20:16:50,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:50,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:50,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:50,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:50,144 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:16:50,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,312 INFO L93 Difference]: Finished difference Result 1493 states and 5167 transitions. [2020-02-10 20:16:50,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:50,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:50,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,315 INFO L225 Difference]: With dead ends: 1493 [2020-02-10 20:16:50,316 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:16:50,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:16:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 805. [2020-02-10 20:16:50,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:16:50,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3169 transitions. [2020-02-10 20:16:50,338 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3169 transitions. Word has length 25 [2020-02-10 20:16:50,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,338 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3169 transitions. [2020-02-10 20:16:50,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:50,339 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3169 transitions. [2020-02-10 20:16:50,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:50,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,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, 1, 1, 1] [2020-02-10 20:16:50,340 INFO L427 AbstractCegarLoop]: === Iteration 477 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1634411119, now seen corresponding path program 470 times [2020-02-10 20:16:50,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556040907] [2020-02-10 20:16:50,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:50,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 20:16:50,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556040907] [2020-02-10 20:16:50,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:50,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:50,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901569362] [2020-02-10 20:16:50,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:50,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:50,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:50,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:50,757 INFO L87 Difference]: Start difference. First operand 805 states and 3169 transitions. Second operand 10 states. [2020-02-10 20:16:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:50,896 INFO L93 Difference]: Finished difference Result 1492 states and 5160 transitions. [2020-02-10 20:16:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:50,896 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:50,900 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:16:50,900 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:16:50,901 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:50,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:16:50,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 800. [2020-02-10 20:16:50,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:50,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3155 transitions. [2020-02-10 20:16:50,924 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3155 transitions. Word has length 25 [2020-02-10 20:16:50,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:50,924 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3155 transitions. [2020-02-10 20:16:50,924 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:50,924 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3155 transitions. [2020-02-10 20:16:50,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:50,925 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:50,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, 1, 1, 1] [2020-02-10 20:16:50,925 INFO L427 AbstractCegarLoop]: === Iteration 478 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:50,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:50,926 INFO L82 PathProgramCache]: Analyzing trace with hash 522262745, now seen corresponding path program 471 times [2020-02-10 20:16:50,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:50,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063650434] [2020-02-10 20:16:50,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:50,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063650434] [2020-02-10 20:16:51,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:51,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968198570] [2020-02-10 20:16:51,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:51,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:51,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:51,334 INFO L87 Difference]: Start difference. First operand 800 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:16:51,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:51,474 INFO L93 Difference]: Finished difference Result 1499 states and 5174 transitions. [2020-02-10 20:16:51,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:51,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:51,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:51,478 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:16:51,478 INFO L226 Difference]: Without dead ends: 1484 [2020-02-10 20:16:51,479 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1484 states. [2020-02-10 20:16:51,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1484 to 807. [2020-02-10 20:16:51,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:16:51,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3168 transitions. [2020-02-10 20:16:51,502 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3168 transitions. Word has length 25 [2020-02-10 20:16:51,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:51,502 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3168 transitions. [2020-02-10 20:16:51,502 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:51,502 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3168 transitions. [2020-02-10 20:16:51,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:51,503 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:51,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, 1, 1, 1] [2020-02-10 20:16:51,503 INFO L427 AbstractCegarLoop]: === Iteration 479 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1623908015, now seen corresponding path program 472 times [2020-02-10 20:16:51,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:51,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779445639] [2020-02-10 20:16:51,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:51,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:51,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779445639] [2020-02-10 20:16:51,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:51,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:51,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831658991] [2020-02-10 20:16:51,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:51,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:51,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:51,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:51,925 INFO L87 Difference]: Start difference. First operand 807 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:16:52,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:52,068 INFO L93 Difference]: Finished difference Result 1502 states and 5173 transitions. [2020-02-10 20:16:52,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:52,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:52,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:52,072 INFO L225 Difference]: With dead ends: 1502 [2020-02-10 20:16:52,072 INFO L226 Difference]: Without dead ends: 1477 [2020-02-10 20:16:52,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:52,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1477 states. [2020-02-10 20:16:52,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1477 to 800. [2020-02-10 20:16:52,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:16:52,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3149 transitions. [2020-02-10 20:16:52,094 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3149 transitions. Word has length 25 [2020-02-10 20:16:52,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:52,095 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3149 transitions. [2020-02-10 20:16:52,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:52,095 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3149 transitions. [2020-02-10 20:16:52,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:52,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:52,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:52,096 INFO L427 AbstractCegarLoop]: === Iteration 480 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:52,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:52,096 INFO L82 PathProgramCache]: Analyzing trace with hash 553772057, now seen corresponding path program 473 times [2020-02-10 20:16:52,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:52,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588615443] [2020-02-10 20:16:52,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:52,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:52,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588615443] [2020-02-10 20:16:52,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:52,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:52,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529434261] [2020-02-10 20:16:52,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:52,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:52,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:52,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:52,513 INFO L87 Difference]: Start difference. First operand 800 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:16:52,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:52,659 INFO L93 Difference]: Finished difference Result 1496 states and 5161 transitions. [2020-02-10 20:16:52,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:52,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:52,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:52,663 INFO L225 Difference]: With dead ends: 1496 [2020-02-10 20:16:52,664 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 20:16:52,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 20:16:52,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 806. [2020-02-10 20:16:52,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:16:52,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3160 transitions. [2020-02-10 20:16:52,686 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3160 transitions. Word has length 25 [2020-02-10 20:16:52,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:52,687 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3160 transitions. [2020-02-10 20:16:52,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:52,687 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3160 transitions. [2020-02-10 20:16:52,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:52,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:52,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:52,688 INFO L427 AbstractCegarLoop]: === Iteration 481 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:52,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:52,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2130254281, now seen corresponding path program 474 times [2020-02-10 20:16:52,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:52,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724538667] [2020-02-10 20:16:52,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,108 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724538667] [2020-02-10 20:16:53,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:53,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047237077] [2020-02-10 20:16:53,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:53,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:53,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:53,109 INFO L87 Difference]: Start difference. First operand 806 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:16:53,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,231 INFO L93 Difference]: Finished difference Result 1500 states and 5163 transitions. [2020-02-10 20:16:53,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:53,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:53,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,235 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 20:16:53,235 INFO L226 Difference]: Without dead ends: 1470 [2020-02-10 20:16:53,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:53,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1470 states. [2020-02-10 20:16:53,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1470 to 794. [2020-02-10 20:16:53,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:16:53,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3132 transitions. [2020-02-10 20:16:53,257 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3132 transitions. Word has length 25 [2020-02-10 20:16:53,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,257 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3132 transitions. [2020-02-10 20:16:53,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:53,257 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3132 transitions. [2020-02-10 20:16:53,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:53,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,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, 1, 1, 1] [2020-02-10 20:16:53,258 INFO L427 AbstractCegarLoop]: === Iteration 482 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1700807667, now seen corresponding path program 475 times [2020-02-10 20:16:53,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709476834] [2020-02-10 20:16:53,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:53,680 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:16:53,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:53,686 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709476834] [2020-02-10 20:16:53,686 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:53,686 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:53,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201611150] [2020-02-10 20:16:53,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:53,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:53,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:53,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:53,687 INFO L87 Difference]: Start difference. First operand 794 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:16:53,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:53,861 INFO L93 Difference]: Finished difference Result 1499 states and 5173 transitions. [2020-02-10 20:16:53,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:53,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:53,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:53,865 INFO L225 Difference]: With dead ends: 1499 [2020-02-10 20:16:53,865 INFO L226 Difference]: Without dead ends: 1483 [2020-02-10 20:16:53,866 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:53,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2020-02-10 20:16:53,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 806. [2020-02-10 20:16:53,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2020-02-10 20:16:53,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 3165 transitions. [2020-02-10 20:16:53,890 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 3165 transitions. Word has length 25 [2020-02-10 20:16:53,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:53,890 INFO L479 AbstractCegarLoop]: Abstraction has 806 states and 3165 transitions. [2020-02-10 20:16:53,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:53,891 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 3165 transitions. [2020-02-10 20:16:53,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:53,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:53,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:53,892 INFO L427 AbstractCegarLoop]: === Iteration 483 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:53,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:53,892 INFO L82 PathProgramCache]: Analyzing trace with hash -983218671, now seen corresponding path program 476 times [2020-02-10 20:16:53,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:53,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113147622] [2020-02-10 20:16:53,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:54,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:54,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113147622] [2020-02-10 20:16:54,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:54,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:54,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331180371] [2020-02-10 20:16:54,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:54,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:54,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:54,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:54,304 INFO L87 Difference]: Start difference. First operand 806 states and 3165 transitions. Second operand 10 states. [2020-02-10 20:16:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:54,492 INFO L93 Difference]: Finished difference Result 1497 states and 5164 transitions. [2020-02-10 20:16:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:54,493 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:54,496 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:16:54,497 INFO L226 Difference]: Without dead ends: 1478 [2020-02-10 20:16:54,497 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:54,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2020-02-10 20:16:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 801. [2020-02-10 20:16:54,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:54,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 20:16:54,520 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 20:16:54,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:54,520 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 20:16:54,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:54,520 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 20:16:54,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:54,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:54,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:54,521 INFO L427 AbstractCegarLoop]: === Iteration 484 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:54,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:54,521 INFO L82 PathProgramCache]: Analyzing trace with hash 100369813, now seen corresponding path program 477 times [2020-02-10 20:16:54,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:54,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953427726] [2020-02-10 20:16:54,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:54,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:54,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:54,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953427726] [2020-02-10 20:16:54,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:54,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:54,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922702662] [2020-02-10 20:16:54,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:54,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:54,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:54,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:54,942 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:16:55,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:55,136 INFO L93 Difference]: Finished difference Result 1507 states and 5184 transitions. [2020-02-10 20:16:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:55,136 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:55,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:55,140 INFO L225 Difference]: With dead ends: 1507 [2020-02-10 20:16:55,140 INFO L226 Difference]: Without dead ends: 1491 [2020-02-10 20:16:55,141 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:55,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1491 states. [2020-02-10 20:16:55,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1491 to 810. [2020-02-10 20:16:55,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:16:55,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 20:16:55,163 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 20:16:55,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:55,163 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 20:16:55,163 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:55,163 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 20:16:55,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:55,164 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:55,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, 1, 1, 1] [2020-02-10 20:16:55,164 INFO L427 AbstractCegarLoop]: === Iteration 485 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:55,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:55,165 INFO L82 PathProgramCache]: Analyzing trace with hash -972715567, now seen corresponding path program 478 times [2020-02-10 20:16:55,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:55,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967832737] [2020-02-10 20:16:55,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:55,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:55,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967832737] [2020-02-10 20:16:55,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:55,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:55,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239424331] [2020-02-10 20:16:55,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:55,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:55,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:55,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:55,587 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:16:55,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:55,757 INFO L93 Difference]: Finished difference Result 1509 states and 5180 transitions. [2020-02-10 20:16:55,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:55,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:55,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:55,761 INFO L225 Difference]: With dead ends: 1509 [2020-02-10 20:16:55,762 INFO L226 Difference]: Without dead ends: 1482 [2020-02-10 20:16:55,762 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:55,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1482 states. [2020-02-10 20:16:55,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1482 to 801. [2020-02-10 20:16:55,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:16:55,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3144 transitions. [2020-02-10 20:16:55,785 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3144 transitions. Word has length 25 [2020-02-10 20:16:55,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:55,785 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3144 transitions. [2020-02-10 20:16:55,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:55,785 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3144 transitions. [2020-02-10 20:16:55,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:55,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:55,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, 1, 1, 1] [2020-02-10 20:16:55,786 INFO L427 AbstractCegarLoop]: === Iteration 486 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:55,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:55,786 INFO L82 PathProgramCache]: Analyzing trace with hash 110872917, now seen corresponding path program 479 times [2020-02-10 20:16:55,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:55,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120005493] [2020-02-10 20:16:55,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120005493] [2020-02-10 20:16:56,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:56,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47955645] [2020-02-10 20:16:56,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:56,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:56,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:56,200 INFO L87 Difference]: Start difference. First operand 801 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:16:56,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,399 INFO L93 Difference]: Finished difference Result 1500 states and 5162 transitions. [2020-02-10 20:16:56,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:56,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:56,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,403 INFO L225 Difference]: With dead ends: 1500 [2020-02-10 20:16:56,403 INFO L226 Difference]: Without dead ends: 1486 [2020-02-10 20:16:56,404 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:56,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2020-02-10 20:16:56,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 807. [2020-02-10 20:16:56,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:16:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3155 transitions. [2020-02-10 20:16:56,426 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3155 transitions. Word has length 25 [2020-02-10 20:16:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:56,426 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3155 transitions. [2020-02-10 20:16:56,426 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3155 transitions. [2020-02-10 20:16:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:56,427 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16: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, 1, 1, 1] [2020-02-10 20:16:56,427 INFO L427 AbstractCegarLoop]: === Iteration 487 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:56,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1721813875, now seen corresponding path program 480 times [2020-02-10 20:16:56,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:56,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869569208] [2020-02-10 20:16:56,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:56,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:56,846 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:56,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869569208] [2020-02-10 20:16:56,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:56,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:56,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096159026] [2020-02-10 20:16:56,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:56,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:56,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:56,847 INFO L87 Difference]: Start difference. First operand 807 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:16:56,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:56,976 INFO L93 Difference]: Finished difference Result 1504 states and 5164 transitions. [2020-02-10 20:16:56,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:56,977 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:56,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:56,981 INFO L225 Difference]: With dead ends: 1504 [2020-02-10 20:16:56,981 INFO L226 Difference]: Without dead ends: 1455 [2020-02-10 20:16:56,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:56,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1455 states. [2020-02-10 20:16:57,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1455 to 776. [2020-02-10 20:16:57,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:16:57,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:16:57,003 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:16:57,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,003 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:16:57,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:57,003 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:16:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:57,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,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, 1, 1, 1] [2020-02-10 20:16:57,004 INFO L427 AbstractCegarLoop]: === Iteration 488 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,005 INFO L82 PathProgramCache]: Analyzing trace with hash -470807655, now seen corresponding path program 481 times [2020-02-10 20:16:57,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5505084] [2020-02-10 20:16:57,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:57,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:57,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5505084] [2020-02-10 20:16:57,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:57,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:57,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203461698] [2020-02-10 20:16:57,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:57,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:57,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:57,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:57,404 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:16:57,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:57,611 INFO L93 Difference]: Finished difference Result 1389 states and 4892 transitions. [2020-02-10 20:16:57,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:57,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:57,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:57,615 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:16:57,615 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:16:57,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:57,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:16:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 790. [2020-02-10 20:16:57,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:16:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3149 transitions. [2020-02-10 20:16:57,638 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3149 transitions. Word has length 25 [2020-02-10 20:16:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:57,638 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3149 transitions. [2020-02-10 20:16:57,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:57,638 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3149 transitions. [2020-02-10 20:16:57,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:57,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:57,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, 1, 1, 1] [2020-02-10 20:16:57,639 INFO L427 AbstractCegarLoop]: === Iteration 489 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:57,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:57,640 INFO L82 PathProgramCache]: Analyzing trace with hash 509947063, now seen corresponding path program 482 times [2020-02-10 20:16:57,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:57,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976068834] [2020-02-10 20:16:57,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:57,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:58,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:58,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976068834] [2020-02-10 20:16:58,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:58,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:58,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137022049] [2020-02-10 20:16:58,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:58,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:58,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:58,029 INFO L87 Difference]: Start difference. First operand 790 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:16:58,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,179 INFO L93 Difference]: Finished difference Result 1388 states and 4887 transitions. [2020-02-10 20:16:58,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:58,180 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:58,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,183 INFO L225 Difference]: With dead ends: 1388 [2020-02-10 20:16:58,183 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:16:58,183 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:58,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:16:58,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:16:58,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:16:58,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3141 transitions. [2020-02-10 20:16:58,205 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3141 transitions. Word has length 25 [2020-02-10 20:16:58,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,205 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3141 transitions. [2020-02-10 20:16:58,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:58,205 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3141 transitions. [2020-02-10 20:16:58,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:58,206 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,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, 1, 1, 1] [2020-02-10 20:16:58,206 INFO L427 AbstractCegarLoop]: === Iteration 490 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1455226423, now seen corresponding path program 483 times [2020-02-10 20:16:58,206 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253286789] [2020-02-10 20:16:58,207 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:58,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 20:16:58,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253286789] [2020-02-10 20:16:58,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:58,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:58,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261911528] [2020-02-10 20:16:58,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:58,602 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:58,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:58,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:58,602 INFO L87 Difference]: Start difference. First operand 787 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:16:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:58,759 INFO L93 Difference]: Finished difference Result 1394 states and 4900 transitions. [2020-02-10 20:16:58,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:58,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:58,764 INFO L225 Difference]: With dead ends: 1394 [2020-02-10 20:16:58,764 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:16:58,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:58,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:16:58,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 791. [2020-02-10 20:16:58,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:16:58,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3148 transitions. [2020-02-10 20:16:58,786 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3148 transitions. Word has length 25 [2020-02-10 20:16:58,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:58,786 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3148 transitions. [2020-02-10 20:16:58,786 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:58,786 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3148 transitions. [2020-02-10 20:16:58,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:58,787 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:58,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, 1, 1, 1] [2020-02-10 20:16:58,787 INFO L427 AbstractCegarLoop]: === Iteration 491 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:58,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1848483051, now seen corresponding path program 484 times [2020-02-10 20:16:58,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:58,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070309821] [2020-02-10 20:16:58,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16: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 20:16:59,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070309821] [2020-02-10 20:16:59,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:59,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075602715] [2020-02-10 20:16:59,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:59,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:59,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:59,174 INFO L87 Difference]: Start difference. First operand 791 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:16:59,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:59,366 INFO L93 Difference]: Finished difference Result 1397 states and 4902 transitions. [2020-02-10 20:16:59,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:59,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:59,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:59,370 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:16:59,370 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:16:59,370 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:59,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:16:59,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 787. [2020-02-10 20:16:59,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:16:59,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:16:59,392 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:16:59,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:59,393 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:16:59,393 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:59,393 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:16:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:59,394 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:59,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, 1, 1, 1] [2020-02-10 20:16:59,394 INFO L427 AbstractCegarLoop]: === Iteration 492 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:59,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:59,394 INFO L82 PathProgramCache]: Analyzing trace with hash 1174168473, now seen corresponding path program 485 times [2020-02-10 20:16:59,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:59,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933382682] [2020-02-10 20:16:59,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:59,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:16:59,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:16:59,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933382682] [2020-02-10 20:16:59,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:16:59,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:16:59,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407816713] [2020-02-10 20:16:59,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:16:59,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:16:59,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:16:59,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:16:59,777 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:16:59,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:16:59,926 INFO L93 Difference]: Finished difference Result 1391 states and 4890 transitions. [2020-02-10 20:16:59,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:16:59,926 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:16:59,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:16:59,930 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:16:59,930 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:16:59,930 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:16:59,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:16:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 20:16:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:16:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3143 transitions. [2020-02-10 20:16:59,952 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3143 transitions. Word has length 25 [2020-02-10 20:16:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:16:59,952 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3143 transitions. [2020-02-10 20:16:59,952 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:16:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3143 transitions. [2020-02-10 20:16:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:16:59,953 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:16:59,953 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:16:59,953 INFO L427 AbstractCegarLoop]: === Iteration 493 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:16:59,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:16:59,953 INFO L82 PathProgramCache]: Analyzing trace with hash -1509857865, now seen corresponding path program 486 times [2020-02-10 20:16:59,953 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:16:59,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26793767] [2020-02-10 20:16:59,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:16:59,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:00,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:00,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26793767] [2020-02-10 20:17:00,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:00,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:00,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729075971] [2020-02-10 20:17:00,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:00,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:00,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:00,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:00,349 INFO L87 Difference]: Start difference. First operand 790 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:17:00,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:00,540 INFO L93 Difference]: Finished difference Result 1395 states and 4895 transitions. [2020-02-10 20:17:00,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:00,541 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:00,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:00,544 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:17:00,544 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:17:00,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:00,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:17:00,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 784. [2020-02-10 20:17:00,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:17:00,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 20:17:00,566 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 20:17:00,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:00,566 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 20:17:00,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:00,566 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 20:17:00,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:00,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:00,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, 1, 1, 1] [2020-02-10 20:17:00,568 INFO L427 AbstractCegarLoop]: === Iteration 494 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:00,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:00,568 INFO L82 PathProgramCache]: Analyzing trace with hash -893293381, now seen corresponding path program 487 times [2020-02-10 20:17:00,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:00,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925136367] [2020-02-10 20:17:00,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:00,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:00,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925136367] [2020-02-10 20:17:00,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:00,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:00,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540453429] [2020-02-10 20:17:00,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:00,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:00,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:00,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:00,969 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:17:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:01,163 INFO L93 Difference]: Finished difference Result 1387 states and 4885 transitions. [2020-02-10 20:17:01,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:01,163 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:01,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:01,166 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:17:01,166 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:17:01,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:01,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:17:01,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 790. [2020-02-10 20:17:01,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3146 transitions. [2020-02-10 20:17:01,188 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3146 transitions. Word has length 25 [2020-02-10 20:17:01,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:01,188 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3146 transitions. [2020-02-10 20:17:01,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3146 transitions. [2020-02-10 20:17:01,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:01,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:01,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, 1, 1, 1] [2020-02-10 20:17:01,190 INFO L427 AbstractCegarLoop]: === Iteration 495 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:01,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:01,190 INFO L82 PathProgramCache]: Analyzing trace with hash 87461337, now seen corresponding path program 488 times [2020-02-10 20:17:01,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:01,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080064295] [2020-02-10 20:17:01,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:01,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:01,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:01,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080064295] [2020-02-10 20:17:01,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:01,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:01,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437115306] [2020-02-10 20:17:01,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:01,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:01,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:01,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:01,608 INFO L87 Difference]: Start difference. First operand 790 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:17:01,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:01,800 INFO L93 Difference]: Finished difference Result 1386 states and 4880 transitions. [2020-02-10 20:17:01,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:01,801 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:01,804 INFO L225 Difference]: With dead ends: 1386 [2020-02-10 20:17:01,805 INFO L226 Difference]: Without dead ends: 1371 [2020-02-10 20:17:01,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:01,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2020-02-10 20:17:01,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 787. [2020-02-10 20:17:01,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:01,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3138 transitions. [2020-02-10 20:17:01,827 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3138 transitions. Word has length 25 [2020-02-10 20:17:01,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:01,827 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3138 transitions. [2020-02-10 20:17:01,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:01,827 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3138 transitions. [2020-02-10 20:17:01,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:01,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:01,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, 1, 1, 1] [2020-02-10 20:17:01,829 INFO L427 AbstractCegarLoop]: === Iteration 496 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:01,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:01,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1336192521, now seen corresponding path program 489 times [2020-02-10 20:17:01,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:01,829 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217689372] [2020-02-10 20:17:01,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:01,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217689372] [2020-02-10 20:17:02,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:02,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756819731] [2020-02-10 20:17:02,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:02,236 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:02,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:02,236 INFO L87 Difference]: Start difference. First operand 787 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:17:02,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:02,428 INFO L93 Difference]: Finished difference Result 1390 states and 4889 transitions. [2020-02-10 20:17:02,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:02,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:02,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:02,432 INFO L225 Difference]: With dead ends: 1390 [2020-02-10 20:17:02,432 INFO L226 Difference]: Without dead ends: 1377 [2020-02-10 20:17:02,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1377 states. [2020-02-10 20:17:02,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1377 to 791. [2020-02-10 20:17:02,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:02,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:17:02,455 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:02,455 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:17:02,455 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:17:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:02,456 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:02,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, 1, 1, 1] [2020-02-10 20:17:02,456 INFO L427 AbstractCegarLoop]: === Iteration 497 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:02,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash -334431595, now seen corresponding path program 490 times [2020-02-10 20:17:02,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:02,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629840349] [2020-02-10 20:17:02,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:02,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:02,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:02,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629840349] [2020-02-10 20:17:02,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:02,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:02,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540782005] [2020-02-10 20:17:02,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:02,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:02,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:02,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:02,867 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:03,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,025 INFO L93 Difference]: Finished difference Result 1391 states and 4887 transitions. [2020-02-10 20:17:03,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:03,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:03,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:03,029 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:17:03,029 INFO L226 Difference]: Without dead ends: 1373 [2020-02-10 20:17:03,030 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:03,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1373 states. [2020-02-10 20:17:03,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1373 to 787. [2020-02-10 20:17:03,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3135 transitions. [2020-02-10 20:17:03,052 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3135 transitions. Word has length 25 [2020-02-10 20:17:03,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:03,052 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3135 transitions. [2020-02-10 20:17:03,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:03,052 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3135 transitions. [2020-02-10 20:17:03,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:03,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:03,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, 1, 1, 1] [2020-02-10 20:17:03,053 INFO L427 AbstractCegarLoop]: === Iteration 498 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:03,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:03,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1077278971, now seen corresponding path program 491 times [2020-02-10 20:17:03,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:03,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956045702] [2020-02-10 20:17:03,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:03,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:03,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956045702] [2020-02-10 20:17:03,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:03,449 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:03,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485177372] [2020-02-10 20:17:03,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:03,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:03,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:03,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:03,449 INFO L87 Difference]: Start difference. First operand 787 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:17:03,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:03,599 INFO L93 Difference]: Finished difference Result 1387 states and 4879 transitions. [2020-02-10 20:17:03,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:03,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:03,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:03,603 INFO L225 Difference]: With dead ends: 1387 [2020-02-10 20:17:03,603 INFO L226 Difference]: Without dead ends: 1375 [2020-02-10 20:17:03,603 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2020-02-10 20:17:03,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 790. [2020-02-10 20:17:03,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:17:03,625 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:03,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:03,625 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:17:03,625 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:03,625 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:17:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:03,626 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:03,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:03,627 INFO L427 AbstractCegarLoop]: === Iteration 499 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:03,627 INFO L82 PathProgramCache]: Analyzing trace with hash 4193591, now seen corresponding path program 492 times [2020-02-10 20:17:03,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:03,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196554567] [2020-02-10 20:17:03,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:03,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:04,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:04,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196554567] [2020-02-10 20:17:04,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:04,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:04,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980661149] [2020-02-10 20:17:04,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:04,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:04,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:04,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:04,017 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:04,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,190 INFO L93 Difference]: Finished difference Result 1389 states and 4880 transitions. [2020-02-10 20:17:04,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:04,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,193 INFO L225 Difference]: With dead ends: 1389 [2020-02-10 20:17:04,194 INFO L226 Difference]: Without dead ends: 1369 [2020-02-10 20:17:04,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1369 states. [2020-02-10 20:17:04,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1369 to 784. [2020-02-10 20:17:04,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:17:04,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3127 transitions. [2020-02-10 20:17:04,215 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3127 transitions. Word has length 25 [2020-02-10 20:17:04,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,215 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3127 transitions. [2020-02-10 20:17:04,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:04,215 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3127 transitions. [2020-02-10 20:17:04,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:04,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,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, 1, 1, 1] [2020-02-10 20:17:04,217 INFO L427 AbstractCegarLoop]: === Iteration 500 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,217 INFO L82 PathProgramCache]: Analyzing trace with hash 610254971, now seen corresponding path program 493 times [2020-02-10 20:17:04,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622088108] [2020-02-10 20:17:04,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:04,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:04,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622088108] [2020-02-10 20:17:04,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:04,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:04,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665483040] [2020-02-10 20:17:04,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:04,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:04,618 INFO L87 Difference]: Start difference. First operand 784 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:17:04,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:04,807 INFO L93 Difference]: Finished difference Result 1400 states and 4914 transitions. [2020-02-10 20:17:04,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:04,807 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:04,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:04,811 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:17:04,811 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:17:04,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:04,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:17:04,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 792. [2020-02-10 20:17:04,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:17:04,834 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:17:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:04,834 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:17:04,834 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:17:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:04,835 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:04,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, 1, 1, 1] [2020-02-10 20:17:04,836 INFO L427 AbstractCegarLoop]: === Iteration 501 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:04,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:04,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1601512793, now seen corresponding path program 494 times [2020-02-10 20:17:04,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:04,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917991695] [2020-02-10 20:17:04,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,253 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:17:05,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917991695] [2020-02-10 20:17:05,260 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:05,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266882807] [2020-02-10 20:17:05,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:05,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:05,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:05,260 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:17:05,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:05,410 INFO L93 Difference]: Finished difference Result 1403 states and 4916 transitions. [2020-02-10 20:17:05,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:05,411 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:05,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:05,414 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:17:05,414 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:17:05,414 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:05,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:17:05,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 788. [2020-02-10 20:17:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:17:05,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3138 transitions. [2020-02-10 20:17:05,436 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3138 transitions. Word has length 25 [2020-02-10 20:17:05,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:05,436 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3138 transitions. [2020-02-10 20:17:05,436 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:05,436 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3138 transitions. [2020-02-10 20:17:05,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:05,437 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:05,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, 1, 1, 1] [2020-02-10 20:17:05,437 INFO L427 AbstractCegarLoop]: === Iteration 502 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:05,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:05,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1758678247, now seen corresponding path program 495 times [2020-02-10 20:17:05,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:05,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122570151] [2020-02-10 20:17:05,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:05,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:05,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:05,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122570151] [2020-02-10 20:17:05,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:05,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:05,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939179765] [2020-02-10 20:17:05,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:05,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:05,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:05,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:05,831 INFO L87 Difference]: Start difference. First operand 788 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:17:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:05,984 INFO L93 Difference]: Finished difference Result 1398 states and 4906 transitions. [2020-02-10 20:17:05,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:05,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:05,988 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:17:05,988 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:17:05,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:06,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:17:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 20:17:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:17:06,011 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,011 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:17:06,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:17:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:06,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:06,012 INFO L427 AbstractCegarLoop]: === Iteration 503 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash -756917321, now seen corresponding path program 496 times [2020-02-10 20:17:06,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882406335] [2020-02-10 20:17:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:06,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882406335] [2020-02-10 20:17:06,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303462190] [2020-02-10 20:17:06,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:06,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:06,407 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:06,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:06,559 INFO L93 Difference]: Finished difference Result 1399 states and 4904 transitions. [2020-02-10 20:17:06,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:06,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:06,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:06,563 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:17:06,563 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:17:06,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:06,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:17:06,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 788. [2020-02-10 20:17:06,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:17:06,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:17:06,586 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:17:06,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:06,586 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:17:06,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:06,586 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:17:06,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:06,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:06,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, 1, 1, 1] [2020-02-10 20:17:06,587 INFO L427 AbstractCegarLoop]: === Iteration 504 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:06,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:06,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1703636869, now seen corresponding path program 497 times [2020-02-10 20:17:06,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:06,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602395521] [2020-02-10 20:17:06,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:06,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:06,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 20:17:06,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602395521] [2020-02-10 20:17:06,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:06,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:06,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544229102] [2020-02-10 20:17:06,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:06,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:06,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:06,979 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:17:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,109 INFO L93 Difference]: Finished difference Result 1405 states and 4917 transitions. [2020-02-10 20:17:07,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:07,110 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,114 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:17:07,114 INFO L226 Difference]: Without dead ends: 1389 [2020-02-10 20:17:07,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:07,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1389 states. [2020-02-10 20:17:07,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1389 to 793. [2020-02-10 20:17:07,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 20:17:07,136 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 20:17:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,136 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 20:17:07,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 20:17:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:07,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,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, 1, 1, 1] [2020-02-10 20:17:07,137 INFO L427 AbstractCegarLoop]: === Iteration 505 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash -92695911, now seen corresponding path program 498 times [2020-02-10 20:17:07,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352987523] [2020-02-10 20:17:07,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:07,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:07,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352987523] [2020-02-10 20:17:07,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:07,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:07,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037952485] [2020-02-10 20:17:07,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:07,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:07,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:07,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:07,525 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:17:07,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:07,659 INFO L93 Difference]: Finished difference Result 1403 states and 4908 transitions. [2020-02-10 20:17:07,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:07,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:07,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:07,663 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:17:07,663 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:17:07,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:17:07,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 784. [2020-02-10 20:17:07,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:17:07,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3124 transitions. [2020-02-10 20:17:07,686 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3124 transitions. Word has length 25 [2020-02-10 20:17:07,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:07,687 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3124 transitions. [2020-02-10 20:17:07,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:07,687 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3124 transitions. [2020-02-10 20:17:07,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:07,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:07,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:07,688 INFO L427 AbstractCegarLoop]: === Iteration 506 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:07,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1793744055, now seen corresponding path program 499 times [2020-02-10 20:17:07,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:07,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550897877] [2020-02-10 20:17:07,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:08,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:08,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550897877] [2020-02-10 20:17:08,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:08,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:08,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835453850] [2020-02-10 20:17:08,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:08,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:08,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:08,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:08,065 INFO L87 Difference]: Start difference. First operand 784 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:17:08,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,215 INFO L93 Difference]: Finished difference Result 1393 states and 4892 transitions. [2020-02-10 20:17:08,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:08,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,219 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:17:08,219 INFO L226 Difference]: Without dead ends: 1381 [2020-02-10 20:17:08,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1381 states. [2020-02-10 20:17:08,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1381 to 790. [2020-02-10 20:17:08,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:08,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3140 transitions. [2020-02-10 20:17:08,241 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:08,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,241 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3140 transitions. [2020-02-10 20:17:08,241 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3140 transitions. [2020-02-10 20:17:08,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:08,242 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,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, 1, 1, 1] [2020-02-10 20:17:08,243 INFO L427 AbstractCegarLoop]: === Iteration 507 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash -890282283, now seen corresponding path program 500 times [2020-02-10 20:17:08,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791920991] [2020-02-10 20:17:08,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17: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 20:17:08,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791920991] [2020-02-10 20:17:08,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:08,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:08,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591533938] [2020-02-10 20:17:08,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:08,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:08,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:08,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:08,618 INFO L87 Difference]: Start difference. First operand 790 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:08,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:08,747 INFO L93 Difference]: Finished difference Result 1397 states and 4897 transitions. [2020-02-10 20:17:08,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:08,747 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:08,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:08,751 INFO L225 Difference]: With dead ends: 1397 [2020-02-10 20:17:08,751 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:17:08,751 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:08,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:17:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 787. [2020-02-10 20:17:08,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:08,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3132 transitions. [2020-02-10 20:17:08,773 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3132 transitions. Word has length 25 [2020-02-10 20:17:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:08,773 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3132 transitions. [2020-02-10 20:17:08,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:08,774 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3132 transitions. [2020-02-10 20:17:08,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:08,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:08,775 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:08,775 INFO L427 AbstractCegarLoop]: === Iteration 508 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:08,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:08,775 INFO L82 PathProgramCache]: Analyzing trace with hash 193306201, now seen corresponding path program 501 times [2020-02-10 20:17:08,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:08,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561883817] [2020-02-10 20:17:08,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:08,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561883817] [2020-02-10 20:17:09,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:09,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650990374] [2020-02-10 20:17:09,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:09,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:09,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:09,184 INFO L87 Difference]: Start difference. First operand 787 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:17:09,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,333 INFO L93 Difference]: Finished difference Result 1391 states and 4885 transitions. [2020-02-10 20:17:09,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:09,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:09,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,337 INFO L225 Difference]: With dead ends: 1391 [2020-02-10 20:17:09,337 INFO L226 Difference]: Without dead ends: 1379 [2020-02-10 20:17:09,338 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:09,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1379 states. [2020-02-10 20:17:09,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1379 to 790. [2020-02-10 20:17:09,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3137 transitions. [2020-02-10 20:17:09,360 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:09,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,360 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3137 transitions. [2020-02-10 20:17:09,361 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3137 transitions. [2020-02-10 20:17:09,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:09,362 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,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, 1, 1, 1] [2020-02-10 20:17:09,362 INFO L427 AbstractCegarLoop]: === Iteration 509 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,362 INFO L82 PathProgramCache]: Analyzing trace with hash -879779179, now seen corresponding path program 502 times [2020-02-10 20:17:09,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691059392] [2020-02-10 20:17:09,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:09,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:09,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691059392] [2020-02-10 20:17:09,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:09,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:09,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288148101] [2020-02-10 20:17:09,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:09,746 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:09,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:09,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:09,746 INFO L87 Difference]: Start difference. First operand 790 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:09,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:09,877 INFO L93 Difference]: Finished difference Result 1393 states and 4886 transitions. [2020-02-10 20:17:09,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:09,878 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:09,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:09,881 INFO L225 Difference]: With dead ends: 1393 [2020-02-10 20:17:09,881 INFO L226 Difference]: Without dead ends: 1376 [2020-02-10 20:17:09,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1376 states. [2020-02-10 20:17:09,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1376 to 787. [2020-02-10 20:17:09,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:09,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 20:17:09,904 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 20:17:09,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:09,904 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 20:17:09,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:09,904 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 20:17:09,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:09,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:09,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, 1, 1, 1] [2020-02-10 20:17:09,905 INFO L427 AbstractCegarLoop]: === Iteration 510 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:09,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash 203809305, now seen corresponding path program 503 times [2020-02-10 20:17:09,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:09,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569563563] [2020-02-10 20:17:09,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:10,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:10,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569563563] [2020-02-10 20:17:10,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:10,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327580390] [2020-02-10 20:17:10,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:10,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:10,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:10,292 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:17:10,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:10,421 INFO L93 Difference]: Finished difference Result 1401 states and 4904 transitions. [2020-02-10 20:17:10,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:10,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:10,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:10,425 INFO L225 Difference]: With dead ends: 1401 [2020-02-10 20:17:10,425 INFO L226 Difference]: Without dead ends: 1385 [2020-02-10 20:17:10,426 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:10,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1385 states. [2020-02-10 20:17:10,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1385 to 792. [2020-02-10 20:17:10,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:10,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3138 transitions. [2020-02-10 20:17:10,448 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3138 transitions. Word has length 25 [2020-02-10 20:17:10,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:10,448 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3138 transitions. [2020-02-10 20:17:10,448 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:10,448 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3138 transitions. [2020-02-10 20:17:10,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:10,449 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:10,449 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:10,450 INFO L427 AbstractCegarLoop]: === Iteration 511 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:10,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:10,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1814750263, now seen corresponding path program 504 times [2020-02-10 20:17:10,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:10,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820769266] [2020-02-10 20:17:10,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:10,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:10,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 20:17:10,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820769266] [2020-02-10 20:17:10,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:10,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:10,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114385679] [2020-02-10 20:17:10,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:10,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:10,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:10,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:10,833 INFO L87 Difference]: Start difference. First operand 792 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:17:10,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:10,967 INFO L93 Difference]: Finished difference Result 1399 states and 4895 transitions. [2020-02-10 20:17:10,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:10,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:10,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:10,971 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:17:10,971 INFO L226 Difference]: Without dead ends: 1374 [2020-02-10 20:17:10,971 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:10,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1374 states. [2020-02-10 20:17:10,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1374 to 781. [2020-02-10 20:17:10,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:17:10,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:17:10,994 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:17:10,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:10,994 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:17:10,994 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:10,994 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:17:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:10,995 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:10,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, 1, 1, 1] [2020-02-10 20:17:10,996 INFO L427 AbstractCegarLoop]: === Iteration 512 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash -682963273, now seen corresponding path program 505 times [2020-02-10 20:17:10,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:10,996 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529812176] [2020-02-10 20:17:10,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529812176] [2020-02-10 20:17:11,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:11,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923442887] [2020-02-10 20:17:11,398 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:11,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:11,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:11,399 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:17:11,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:11,537 INFO L93 Difference]: Finished difference Result 1406 states and 4929 transitions. [2020-02-10 20:17:11,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:11,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:11,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:11,541 INFO L225 Difference]: With dead ends: 1406 [2020-02-10 20:17:11,541 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:17:11,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:11,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:17:11,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 20:17:11,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:11,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3153 transitions. [2020-02-10 20:17:11,566 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3153 transitions. Word has length 25 [2020-02-10 20:17:11,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:11,566 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3153 transitions. [2020-02-10 20:17:11,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:11,566 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3153 transitions. [2020-02-10 20:17:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:11,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:11,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, 1, 1, 1] [2020-02-10 20:17:11,567 INFO L427 AbstractCegarLoop]: === Iteration 513 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:11,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:11,567 INFO L82 PathProgramCache]: Analyzing trace with hash 297791445, now seen corresponding path program 506 times [2020-02-10 20:17:11,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:11,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729979558] [2020-02-10 20:17:11,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:11,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:11,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:11,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729979558] [2020-02-10 20:17:11,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:11,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:11,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831110880] [2020-02-10 20:17:11,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:11,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:11,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:11,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:11,968 INFO L87 Difference]: Start difference. First operand 792 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:17:12,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:12,098 INFO L93 Difference]: Finished difference Result 1405 states and 4924 transitions. [2020-02-10 20:17:12,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:12,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:12,102 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:17:12,102 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:17:12,102 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:12,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:17:12,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:17:12,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:12,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3145 transitions. [2020-02-10 20:17:12,124 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:12,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:12,124 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3145 transitions. [2020-02-10 20:17:12,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3145 transitions. [2020-02-10 20:17:12,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:12,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:12,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, 1, 1, 1] [2020-02-10 20:17:12,125 INFO L427 AbstractCegarLoop]: === Iteration 514 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:12,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:12,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1243070805, now seen corresponding path program 507 times [2020-02-10 20:17:12,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:12,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942546528] [2020-02-10 20:17:12,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:12,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:12,519 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942546528] [2020-02-10 20:17:12,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:12,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:12,520 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939534002] [2020-02-10 20:17:12,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:12,520 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:12,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:12,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:12,520 INFO L87 Difference]: Start difference. First operand 789 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:12,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:12,654 INFO L93 Difference]: Finished difference Result 1411 states and 4937 transitions. [2020-02-10 20:17:12,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:12,655 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:12,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:12,659 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:17:12,659 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:17:12,659 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:12,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:17:12,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:17:12,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:12,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3152 transitions. [2020-02-10 20:17:12,682 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3152 transitions. Word has length 25 [2020-02-10 20:17:12,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:12,683 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3152 transitions. [2020-02-10 20:17:12,683 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:12,683 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3152 transitions. [2020-02-10 20:17:12,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:12,684 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:12,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, 1, 1, 1] [2020-02-10 20:17:12,684 INFO L427 AbstractCegarLoop]: === Iteration 515 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:12,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:12,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2060638669, now seen corresponding path program 508 times [2020-02-10 20:17:12,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:12,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203022049] [2020-02-10 20:17:12,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:12,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:13,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203022049] [2020-02-10 20:17:13,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:13,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816674846] [2020-02-10 20:17:13,101 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:13,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:13,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:13,101 INFO L87 Difference]: Start difference. First operand 793 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:17:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,231 INFO L93 Difference]: Finished difference Result 1414 states and 4939 transitions. [2020-02-10 20:17:13,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:13,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,235 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:17:13,235 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:17:13,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:13,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:17:13,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:17:13,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:13,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3142 transitions. [2020-02-10 20:17:13,258 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3142 transitions. Word has length 25 [2020-02-10 20:17:13,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,258 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3142 transitions. [2020-02-10 20:17:13,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:13,258 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3142 transitions. [2020-02-10 20:17:13,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:13,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,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, 1, 1, 1] [2020-02-10 20:17:13,260 INFO L427 AbstractCegarLoop]: === Iteration 516 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,260 INFO L82 PathProgramCache]: Analyzing trace with hash 962012855, now seen corresponding path program 509 times [2020-02-10 20:17:13,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067036348] [2020-02-10 20:17:13,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:13,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 20:17:13,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067036348] [2020-02-10 20:17:13,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:13,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:13,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338317881] [2020-02-10 20:17:13,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:13,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:13,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:13,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:13,649 INFO L87 Difference]: Start difference. First operand 789 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:17:13,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:13,776 INFO L93 Difference]: Finished difference Result 1408 states and 4927 transitions. [2020-02-10 20:17:13,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:13,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:13,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:13,780 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:17:13,780 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:17:13,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:13,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:17:13,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 792. [2020-02-10 20:17:13,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:13,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:17:13,802 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:17:13,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:13,802 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:17:13,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:13,802 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:17:13,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:13,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:13,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:13,803 INFO L427 AbstractCegarLoop]: === Iteration 517 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:13,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:13,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1722013483, now seen corresponding path program 510 times [2020-02-10 20:17:13,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:13,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753999932] [2020-02-10 20:17:13,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:13,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:14,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:14,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753999932] [2020-02-10 20:17:14,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:14,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:14,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039631156] [2020-02-10 20:17:14,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:14,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:14,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:14,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:14,198 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:17:14,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,343 INFO L93 Difference]: Finished difference Result 1412 states and 4932 transitions. [2020-02-10 20:17:14,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:14,344 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:14,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,347 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:17:14,348 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:17:14,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:14,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:17:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 786. [2020-02-10 20:17:14,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:17:14,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3134 transitions. [2020-02-10 20:17:14,370 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3134 transitions. Word has length 25 [2020-02-10 20:17:14,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,370 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3134 transitions. [2020-02-10 20:17:14,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:14,370 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3134 transitions. [2020-02-10 20:17:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:14,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,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, 1, 1, 1] [2020-02-10 20:17:14,371 INFO L427 AbstractCegarLoop]: === Iteration 518 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1527934725, now seen corresponding path program 511 times [2020-02-10 20:17:14,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300763240] [2020-02-10 20:17:14,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:14,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:14,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300763240] [2020-02-10 20:17:14,768 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:14,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:14,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497028304] [2020-02-10 20:17:14,768 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:14,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:14,768 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:14,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:14,768 INFO L87 Difference]: Start difference. First operand 786 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:17:14,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:14,906 INFO L93 Difference]: Finished difference Result 1411 states and 4936 transitions. [2020-02-10 20:17:14,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:14,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:14,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:14,910 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:17:14,910 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:17:14,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:17:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:17:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:14,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3153 transitions. [2020-02-10 20:17:14,933 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3153 transitions. Word has length 25 [2020-02-10 20:17:14,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:14,933 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3153 transitions. [2020-02-10 20:17:14,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:14,933 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3153 transitions. [2020-02-10 20:17:14,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:14,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:14,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, 1, 1, 1] [2020-02-10 20:17:14,934 INFO L427 AbstractCegarLoop]: === Iteration 519 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:14,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:14,934 INFO L82 PathProgramCache]: Analyzing trace with hash -547180007, now seen corresponding path program 512 times [2020-02-10 20:17:14,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:14,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800944264] [2020-02-10 20:17:14,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:14,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:15,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800944264] [2020-02-10 20:17:15,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:15,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575041228] [2020-02-10 20:17:15,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:15,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:15,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:15,334 INFO L87 Difference]: Start difference. First operand 793 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:17:15,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:15,469 INFO L93 Difference]: Finished difference Result 1410 states and 4931 transitions. [2020-02-10 20:17:15,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:15,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:15,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:15,472 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:17:15,472 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:17:15,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:17:15,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 20:17:15,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:15,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3145 transitions. [2020-02-10 20:17:15,494 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:15,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:15,494 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3145 transitions. [2020-02-10 20:17:15,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:15,495 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3145 transitions. [2020-02-10 20:17:15,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:15,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:15,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, 1, 1, 1] [2020-02-10 20:17:15,496 INFO L427 AbstractCegarLoop]: === Iteration 520 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:15,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:15,496 INFO L82 PathProgramCache]: Analyzing trace with hash -44799787, now seen corresponding path program 513 times [2020-02-10 20:17:15,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:15,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820331839] [2020-02-10 20:17:15,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:15,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:15,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 20:17:15,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820331839] [2020-02-10 20:17:15,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:15,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:15,902 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511997988] [2020-02-10 20:17:15,902 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:15,902 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:15,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:15,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:15,903 INFO L87 Difference]: Start difference. First operand 790 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:16,050 INFO L93 Difference]: Finished difference Result 1419 states and 4949 transitions. [2020-02-10 20:17:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:16,051 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:16,055 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:17:16,055 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:17:16,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:16,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:17:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 795. [2020-02-10 20:17:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:16,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3154 transitions. [2020-02-10 20:17:16,077 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3154 transitions. Word has length 25 [2020-02-10 20:17:16,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:16,077 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3154 transitions. [2020-02-10 20:17:16,077 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:16,078 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3154 transitions. [2020-02-10 20:17:16,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:16,078 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:16,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, 1, 1, 1] [2020-02-10 20:17:16,079 INFO L427 AbstractCegarLoop]: === Iteration 521 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:16,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:16,079 INFO L82 PathProgramCache]: Analyzing trace with hash 967464243, now seen corresponding path program 514 times [2020-02-10 20:17:16,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:16,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846440284] [2020-02-10 20:17:16,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:16,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:16,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846440284] [2020-02-10 20:17:16,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:16,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:16,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285344001] [2020-02-10 20:17:16,476 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:16,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:16,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:16,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:16,476 INFO L87 Difference]: Start difference. First operand 795 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:17:16,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:16,588 INFO L93 Difference]: Finished difference Result 1424 states and 4954 transitions. [2020-02-10 20:17:16,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:16,588 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:16,592 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:17:16,592 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:17:16,592 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:17:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 790. [2020-02-10 20:17:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:16,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3141 transitions. [2020-02-10 20:17:16,614 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3141 transitions. Word has length 25 [2020-02-10 20:17:16,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:16,614 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3141 transitions. [2020-02-10 20:17:16,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:16,614 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3141 transitions. [2020-02-10 20:17:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:16,615 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:16,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, 1, 1, 1] [2020-02-10 20:17:16,616 INFO L427 AbstractCegarLoop]: === Iteration 522 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:16,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:16,616 INFO L82 PathProgramCache]: Analyzing trace with hash 768233851, now seen corresponding path program 515 times [2020-02-10 20:17:16,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:16,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931263812] [2020-02-10 20:17:16,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931263812] [2020-02-10 20:17:17,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:17,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960344701] [2020-02-10 20:17:17,033 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:17,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:17,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:17,033 INFO L87 Difference]: Start difference. First operand 790 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:17:17,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,166 INFO L93 Difference]: Finished difference Result 1416 states and 4938 transitions. [2020-02-10 20:17:17,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:17,167 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:17,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,170 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:17:17,170 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:17:17,171 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:17:17,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 794. [2020-02-10 20:17:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:17,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3148 transitions. [2020-02-10 20:17:17,192 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3148 transitions. Word has length 25 [2020-02-10 20:17:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,192 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3148 transitions. [2020-02-10 20:17:17,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:17,193 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3148 transitions. [2020-02-10 20:17:17,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:17,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,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, 1, 1, 1] [2020-02-10 20:17:17,194 INFO L427 AbstractCegarLoop]: === Iteration 523 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1306089429, now seen corresponding path program 516 times [2020-02-10 20:17:17,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812363627] [2020-02-10 20:17:17,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:17,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:17,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812363627] [2020-02-10 20:17:17,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:17,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:17,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361800383] [2020-02-10 20:17:17,591 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:17,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:17,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:17,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:17,592 INFO L87 Difference]: Start difference. First operand 794 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:17:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:17,698 INFO L93 Difference]: Finished difference Result 1422 states and 4946 transitions. [2020-02-10 20:17:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:17,699 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:17,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:17,702 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:17:17,702 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:17:17,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:17,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:17:17,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 20:17:17,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:17:17,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 20:17:17,724 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 20:17:17,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:17,724 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 20:17:17,724 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:17,724 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 20:17:17,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:17,725 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:17,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, 1, 1, 1] [2020-02-10 20:17:17,726 INFO L427 AbstractCegarLoop]: === Iteration 524 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:17,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:17,726 INFO L82 PathProgramCache]: Analyzing trace with hash -24386373, now seen corresponding path program 517 times [2020-02-10 20:17:17,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:17,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502456719] [2020-02-10 20:17:17,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:18,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 20:17:18,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502456719] [2020-02-10 20:17:18,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:18,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:18,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408824347] [2020-02-10 20:17:18,128 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:18,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:18,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:18,128 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:17:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,259 INFO L93 Difference]: Finished difference Result 1428 states and 4973 transitions. [2020-02-10 20:17:18,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:18,259 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:18,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,262 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:17:18,262 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:17:18,263 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:18,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:17:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 796. [2020-02-10 20:17:18,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:17:18,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3157 transitions. [2020-02-10 20:17:18,284 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3157 transitions. Word has length 25 [2020-02-10 20:17:18,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,285 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3157 transitions. [2020-02-10 20:17:18,285 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:18,285 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3157 transitions. [2020-02-10 20:17:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:18,286 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,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, 1, 1, 1] [2020-02-10 20:17:18,286 INFO L427 AbstractCegarLoop]: === Iteration 525 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,286 INFO L82 PathProgramCache]: Analyzing trace with hash 966871449, now seen corresponding path program 518 times [2020-02-10 20:17:18,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128186373] [2020-02-10 20:17:18,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:18,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:18,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128186373] [2020-02-10 20:17:18,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:18,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:18,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787549159] [2020-02-10 20:17:18,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:18,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:18,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:18,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:18,685 INFO L87 Difference]: Start difference. First operand 796 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:17:18,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:18,820 INFO L93 Difference]: Finished difference Result 1431 states and 4975 transitions. [2020-02-10 20:17:18,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:18,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:18,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:18,824 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:17:18,824 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:17:18,824 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:17:18,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 792. [2020-02-10 20:17:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 20:17:18,847 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 20:17:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:18,847 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 20:17:18,847 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:18,847 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 20:17:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:18,848 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:18,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, 1, 1, 1] [2020-02-10 20:17:18,848 INFO L427 AbstractCegarLoop]: === Iteration 526 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:18,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:18,848 INFO L82 PathProgramCache]: Analyzing trace with hash -467285513, now seen corresponding path program 519 times [2020-02-10 20:17:18,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:18,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678550656] [2020-02-10 20:17:18,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:18,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678550656] [2020-02-10 20:17:19,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:19,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550336005] [2020-02-10 20:17:19,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:19,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:19,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:19,247 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:17:19,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,384 INFO L93 Difference]: Finished difference Result 1431 states and 4974 transitions. [2020-02-10 20:17:19,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:19,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:19,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,388 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:17:19,388 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:17:19,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:19,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:17:19,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 797. [2020-02-10 20:17:19,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:17:19,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3155 transitions. [2020-02-10 20:17:19,410 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3155 transitions. Word has length 25 [2020-02-10 20:17:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,410 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3155 transitions. [2020-02-10 20:17:19,410 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3155 transitions. [2020-02-10 20:17:19,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:19,411 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:19,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, 1, 1, 1] [2020-02-10 20:17:19,412 INFO L427 AbstractCegarLoop]: === Iteration 527 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,412 INFO L82 PathProgramCache]: Analyzing trace with hash 544978517, now seen corresponding path program 520 times [2020-02-10 20:17:19,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405520526] [2020-02-10 20:17:19,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:19,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:19,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405520526] [2020-02-10 20:17:19,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:19,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:19,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876031231] [2020-02-10 20:17:19,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:19,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:19,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:19,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:19,826 INFO L87 Difference]: Start difference. First operand 797 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:17:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:19,946 INFO L93 Difference]: Finished difference Result 1436 states and 4979 transitions. [2020-02-10 20:17:19,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:19,947 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:19,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:19,950 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:17:19,950 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:17:19,951 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:19,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:17:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 792. [2020-02-10 20:17:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3141 transitions. [2020-02-10 20:17:19,973 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3141 transitions. Word has length 25 [2020-02-10 20:17:19,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:19,973 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3141 transitions. [2020-02-10 20:17:19,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:19,973 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3141 transitions. [2020-02-10 20:17:19,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:19,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17: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, 1, 1, 1] [2020-02-10 20:17:19,974 INFO L427 AbstractCegarLoop]: === Iteration 528 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:19,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:19,975 INFO L82 PathProgramCache]: Analyzing trace with hash -2012681989, now seen corresponding path program 521 times [2020-02-10 20:17:19,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:19,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845922503] [2020-02-10 20:17:19,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:19,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:20,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:20,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845922503] [2020-02-10 20:17:20,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:20,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:20,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782905384] [2020-02-10 20:17:20,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:20,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:20,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:20,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:20,381 INFO L87 Difference]: Start difference. First operand 792 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:17:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:20,519 INFO L93 Difference]: Finished difference Result 1441 states and 4991 transitions. [2020-02-10 20:17:20,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:20,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:20,523 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:17:20,523 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:17:20,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:17:20,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 801. [2020-02-10 20:17:20,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:17:20,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3157 transitions. [2020-02-10 20:17:20,545 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3157 transitions. Word has length 25 [2020-02-10 20:17:20,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:20,545 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3157 transitions. [2020-02-10 20:17:20,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:20,545 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3157 transitions. [2020-02-10 20:17:20,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:20,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:20,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, 1, 1, 1] [2020-02-10 20:17:20,547 INFO L427 AbstractCegarLoop]: === Iteration 529 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:20,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:20,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1209199927, now seen corresponding path program 522 times [2020-02-10 20:17:20,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:20,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309972371] [2020-02-10 20:17:20,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:20,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:20,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:20,991 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309972371] [2020-02-10 20:17:20,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:20,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:20,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652219798] [2020-02-10 20:17:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:20,991 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:20,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:20,992 INFO L87 Difference]: Start difference. First operand 801 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:17:21,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,111 INFO L93 Difference]: Finished difference Result 1443 states and 4987 transitions. [2020-02-10 20:17:21,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:21,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:21,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,114 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:17:21,115 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:17:21,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:17:21,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 786. [2020-02-10 20:17:21,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:17:21,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3125 transitions. [2020-02-10 20:17:21,137 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3125 transitions. Word has length 25 [2020-02-10 20:17:21,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,137 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3125 transitions. [2020-02-10 20:17:21,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3125 transitions. [2020-02-10 20:17:21,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:21,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,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, 1, 1, 1] [2020-02-10 20:17:21,138 INFO L427 AbstractCegarLoop]: === Iteration 530 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1209830507, now seen corresponding path program 523 times [2020-02-10 20:17:21,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422592129] [2020-02-10 20:17:21,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:21,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:21,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422592129] [2020-02-10 20:17:21,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:21,537 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:21,537 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006130012] [2020-02-10 20:17:21,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:21,538 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:21,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:21,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:21,538 INFO L87 Difference]: Start difference. First operand 786 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:17:21,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:21,675 INFO L93 Difference]: Finished difference Result 1421 states and 4949 transitions. [2020-02-10 20:17:21,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:21,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:21,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:21,678 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:17:21,679 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:17:21,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:21,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:17:21,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 20:17:21,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:17:21,701 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:17:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:21,701 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:17:21,701 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:17:21,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:21,702 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:21,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, 1, 1, 1] [2020-02-10 20:17:21,702 INFO L427 AbstractCegarLoop]: === Iteration 531 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:21,702 INFO L82 PathProgramCache]: Analyzing trace with hash 401110451, now seen corresponding path program 524 times [2020-02-10 20:17:21,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:21,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817840429] [2020-02-10 20:17:21,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:22,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:22,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817840429] [2020-02-10 20:17:22,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:22,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:22,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903468496] [2020-02-10 20:17:22,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:22,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:22,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:22,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:22,075 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:17:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,194 INFO L93 Difference]: Finished difference Result 1425 states and 4954 transitions. [2020-02-10 20:17:22,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:22,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:22,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,198 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:17:22,198 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:17:22,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:17:22,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 791. [2020-02-10 20:17:22,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:22,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3138 transitions. [2020-02-10 20:17:22,220 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3138 transitions. Word has length 25 [2020-02-10 20:17:22,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:22,220 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3138 transitions. [2020-02-10 20:17:22,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:22,220 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3138 transitions. [2020-02-10 20:17:22,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:22,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:22,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, 1, 1, 1] [2020-02-10 20:17:22,221 INFO L427 AbstractCegarLoop]: === Iteration 532 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:22,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:22,221 INFO L82 PathProgramCache]: Analyzing trace with hash -115738919, now seen corresponding path program 525 times [2020-02-10 20:17:22,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:22,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863136537] [2020-02-10 20:17:22,222 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:22,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:22,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863136537] [2020-02-10 20:17:22,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:22,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:22,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570953228] [2020-02-10 20:17:22,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:22,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:22,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:22,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:22,620 INFO L87 Difference]: Start difference. First operand 791 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:17:22,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:22,754 INFO L93 Difference]: Finished difference Result 1424 states and 4951 transitions. [2020-02-10 20:17:22,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:22,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:22,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:22,758 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:17:22,759 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:17:22,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:22,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:17:22,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 795. [2020-02-10 20:17:22,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:22,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:17:22,781 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:22,781 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:17:22,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:17:22,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:22,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:22,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, 1, 1, 1] [2020-02-10 20:17:22,783 INFO L427 AbstractCegarLoop]: === Iteration 533 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:22,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:22,783 INFO L82 PathProgramCache]: Analyzing trace with hash 422116659, now seen corresponding path program 526 times [2020-02-10 20:17:22,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:22,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997230685] [2020-02-10 20:17:22,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:22,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997230685] [2020-02-10 20:17:23,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:23,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871791054] [2020-02-10 20:17:23,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:23,186 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:23,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:23,186 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:23,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,299 INFO L93 Difference]: Finished difference Result 1430 states and 4959 transitions. [2020-02-10 20:17:23,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:23,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:23,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,303 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:17:23,303 INFO L226 Difference]: Without dead ends: 1408 [2020-02-10 20:17:23,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:23,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1408 states. [2020-02-10 20:17:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1408 to 791. [2020-02-10 20:17:23,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:23,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3134 transitions. [2020-02-10 20:17:23,326 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3134 transitions. Word has length 25 [2020-02-10 20:17:23,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,326 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3134 transitions. [2020-02-10 20:17:23,327 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:23,327 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3134 transitions. [2020-02-10 20:17:23,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:23,328 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,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, 1, 1, 1] [2020-02-10 20:17:23,328 INFO L427 AbstractCegarLoop]: === Iteration 534 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,328 INFO L82 PathProgramCache]: Analyzing trace with hash -105235815, now seen corresponding path program 527 times [2020-02-10 20:17:23,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310200309] [2020-02-10 20:17:23,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:23,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:23,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310200309] [2020-02-10 20:17:23,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:23,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:23,735 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454123142] [2020-02-10 20:17:23,735 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:23,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:23,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:23,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:23,736 INFO L87 Difference]: Start difference. First operand 791 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:17:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:23,874 INFO L93 Difference]: Finished difference Result 1437 states and 4976 transitions. [2020-02-10 20:17:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:23,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:23,878 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:17:23,879 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:17:23,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:23,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:17:23,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 800. [2020-02-10 20:17:23,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:17:23,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3150 transitions. [2020-02-10 20:17:23,901 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3150 transitions. Word has length 25 [2020-02-10 20:17:23,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:23,901 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3150 transitions. [2020-02-10 20:17:23,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:23,901 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3150 transitions. [2020-02-10 20:17:23,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:23,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:23,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, 1, 1, 1] [2020-02-10 20:17:23,902 INFO L427 AbstractCegarLoop]: === Iteration 535 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:23,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:23,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1178321195, now seen corresponding path program 528 times [2020-02-10 20:17:23,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:23,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366637880] [2020-02-10 20:17:23,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:23,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,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 20:17:24,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366637880] [2020-02-10 20:17:24,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:24,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173817171] [2020-02-10 20:17:24,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:24,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:24,324 INFO L87 Difference]: Start difference. First operand 800 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:17:24,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:24,481 INFO L93 Difference]: Finished difference Result 1439 states and 4972 transitions. [2020-02-10 20:17:24,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:24,481 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:24,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:24,484 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:17:24,484 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:17:24,485 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:24,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:17:24,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 781. [2020-02-10 20:17:24,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:17:24,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3111 transitions. [2020-02-10 20:17:24,506 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3111 transitions. Word has length 25 [2020-02-10 20:17:24,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:24,506 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3111 transitions. [2020-02-10 20:17:24,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:24,507 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3111 transitions. [2020-02-10 20:17:24,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:24,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:24,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, 1, 1, 1] [2020-02-10 20:17:24,508 INFO L427 AbstractCegarLoop]: === Iteration 536 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:24,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:24,508 INFO L82 PathProgramCache]: Analyzing trace with hash -1317604617, now seen corresponding path program 529 times [2020-02-10 20:17:24,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:24,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079350379] [2020-02-10 20:17:24,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:24,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:24,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079350379] [2020-02-10 20:17:24,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:24,941 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:24,941 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527754607] [2020-02-10 20:17:24,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:24,942 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:24,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:24,942 INFO L87 Difference]: Start difference. First operand 781 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:17:25,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,080 INFO L93 Difference]: Finished difference Result 1396 states and 4902 transitions. [2020-02-10 20:17:25,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:25,081 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:25,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,085 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:17:25,085 INFO L226 Difference]: Without dead ends: 1383 [2020-02-10 20:17:25,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:25,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1383 states. [2020-02-10 20:17:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1383 to 791. [2020-02-10 20:17:25,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:25,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3145 transitions. [2020-02-10 20:17:25,107 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:25,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,107 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3145 transitions. [2020-02-10 20:17:25,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:25,107 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3145 transitions. [2020-02-10 20:17:25,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:25,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,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, 1, 1, 1] [2020-02-10 20:17:25,108 INFO L427 AbstractCegarLoop]: === Iteration 537 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,108 INFO L82 PathProgramCache]: Analyzing trace with hash -336849899, now seen corresponding path program 530 times [2020-02-10 20:17:25,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688298592] [2020-02-10 20:17:25,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:25,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:25,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688298592] [2020-02-10 20:17:25,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:25,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:25,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080938124] [2020-02-10 20:17:25,524 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:25,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:25,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:25,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:25,524 INFO L87 Difference]: Start difference. First operand 791 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:25,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:25,674 INFO L93 Difference]: Finished difference Result 1395 states and 4897 transitions. [2020-02-10 20:17:25,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:25,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:25,678 INFO L225 Difference]: With dead ends: 1395 [2020-02-10 20:17:25,679 INFO L226 Difference]: Without dead ends: 1380 [2020-02-10 20:17:25,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:25,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1380 states. [2020-02-10 20:17:25,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1380 to 788. [2020-02-10 20:17:25,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:17:25,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3137 transitions. [2020-02-10 20:17:25,703 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:25,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:25,703 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3137 transitions. [2020-02-10 20:17:25,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:25,703 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3137 transitions. [2020-02-10 20:17:25,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:25,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:25,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, 1, 1, 1] [2020-02-10 20:17:25,704 INFO L427 AbstractCegarLoop]: === Iteration 538 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:25,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:25,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1760503757, now seen corresponding path program 531 times [2020-02-10 20:17:25,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:25,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100704283] [2020-02-10 20:17:25,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,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 20:17:26,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100704283] [2020-02-10 20:17:26,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:26,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462808929] [2020-02-10 20:17:26,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:26,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:26,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:26,113 INFO L87 Difference]: Start difference. First operand 788 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:26,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,255 INFO L93 Difference]: Finished difference Result 1399 states and 4906 transitions. [2020-02-10 20:17:26,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:26,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:26,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:26,259 INFO L225 Difference]: With dead ends: 1399 [2020-02-10 20:17:26,259 INFO L226 Difference]: Without dead ends: 1386 [2020-02-10 20:17:26,259 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2020-02-10 20:17:26,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 792. [2020-02-10 20:17:26,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 20:17:26,281 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 20:17:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:26,281 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 20:17:26,281 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 20:17:26,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:26,282 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:26,282 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:26,282 INFO L427 AbstractCegarLoop]: === Iteration 539 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:26,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:26,282 INFO L82 PathProgramCache]: Analyzing trace with hash -758742831, now seen corresponding path program 532 times [2020-02-10 20:17:26,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:26,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618737391] [2020-02-10 20:17:26,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:26,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:26,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618737391] [2020-02-10 20:17:26,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:26,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:26,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306354001] [2020-02-10 20:17:26,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:26,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:26,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:26,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:26,691 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:17:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:26,832 INFO L93 Difference]: Finished difference Result 1400 states and 4904 transitions. [2020-02-10 20:17:26,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:26,833 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:26,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:26,836 INFO L225 Difference]: With dead ends: 1400 [2020-02-10 20:17:26,836 INFO L226 Difference]: Without dead ends: 1382 [2020-02-10 20:17:26,837 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:26,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1382 states. [2020-02-10 20:17:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1382 to 788. [2020-02-10 20:17:26,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:17:26,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3134 transitions. [2020-02-10 20:17:26,858 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3134 transitions. Word has length 25 [2020-02-10 20:17:26,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:26,859 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3134 transitions. [2020-02-10 20:17:26,859 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:26,859 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3134 transitions. [2020-02-10 20:17:26,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:26,860 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:26,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, 1, 1, 1] [2020-02-10 20:17:26,860 INFO L427 AbstractCegarLoop]: === Iteration 540 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:26,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:26,860 INFO L82 PathProgramCache]: Analyzing trace with hash 652967735, now seen corresponding path program 533 times [2020-02-10 20:17:26,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:26,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470383448] [2020-02-10 20:17:26,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:26,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:27,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 20:17:27,260 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470383448] [2020-02-10 20:17:27,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:27,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:27,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545853493] [2020-02-10 20:17:27,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:27,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:27,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:27,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:27,261 INFO L87 Difference]: Start difference. First operand 788 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:17:27,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,404 INFO L93 Difference]: Finished difference Result 1396 states and 4896 transitions. [2020-02-10 20:17:27,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:27,404 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:27,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,408 INFO L225 Difference]: With dead ends: 1396 [2020-02-10 20:17:27,408 INFO L226 Difference]: Without dead ends: 1384 [2020-02-10 20:17:27,408 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:27,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2020-02-10 20:17:27,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 791. [2020-02-10 20:17:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:27,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3139 transitions. [2020-02-10 20:17:27,430 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3139 transitions. Word has length 25 [2020-02-10 20:17:27,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:27,430 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3139 transitions. [2020-02-10 20:17:27,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:27,430 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3139 transitions. [2020-02-10 20:17:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:27,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:27,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, 1, 1, 1] [2020-02-10 20:17:27,431 INFO L427 AbstractCegarLoop]: === Iteration 541 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:27,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:27,431 INFO L82 PathProgramCache]: Analyzing trace with hash -420117645, now seen corresponding path program 534 times [2020-02-10 20:17:27,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:27,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389688439] [2020-02-10 20:17:27,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:27,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:27,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389688439] [2020-02-10 20:17:27,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:27,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:27,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756311749] [2020-02-10 20:17:27,841 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:27,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:27,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:27,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:27,842 INFO L87 Difference]: Start difference. First operand 791 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:17:27,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:27,982 INFO L93 Difference]: Finished difference Result 1398 states and 4897 transitions. [2020-02-10 20:17:27,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:27,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:27,986 INFO L225 Difference]: With dead ends: 1398 [2020-02-10 20:17:27,987 INFO L226 Difference]: Without dead ends: 1378 [2020-02-10 20:17:27,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:27,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1378 states. [2020-02-10 20:17:28,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1378 to 785. [2020-02-10 20:17:28,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:17:28,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3126 transitions. [2020-02-10 20:17:28,010 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3126 transitions. Word has length 25 [2020-02-10 20:17:28,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:28,010 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3126 transitions. [2020-02-10 20:17:28,010 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:28,010 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3126 transitions. [2020-02-10 20:17:28,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:28,011 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:28,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, 1, 1, 1] [2020-02-10 20:17:28,011 INFO L427 AbstractCegarLoop]: === Iteration 542 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:28,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:28,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1740090343, now seen corresponding path program 535 times [2020-02-10 20:17:28,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:28,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821511752] [2020-02-10 20:17:28,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:28,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:28,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821511752] [2020-02-10 20:17:28,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:28,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:28,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140615272] [2020-02-10 20:17:28,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:28,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:28,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:28,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:28,422 INFO L87 Difference]: Start difference. First operand 785 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:17:28,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:28,560 INFO L93 Difference]: Finished difference Result 1403 states and 4913 transitions. [2020-02-10 20:17:28,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:28,560 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:28,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:28,564 INFO L225 Difference]: With dead ends: 1403 [2020-02-10 20:17:28,564 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:17:28,565 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:28,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:17:28,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 792. [2020-02-10 20:17:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:28,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3145 transitions. [2020-02-10 20:17:28,587 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:28,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:28,587 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3145 transitions. [2020-02-10 20:17:28,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3145 transitions. [2020-02-10 20:17:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:28,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:28,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:28,588 INFO L427 AbstractCegarLoop]: === Iteration 543 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:28,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:28,588 INFO L82 PathProgramCache]: Analyzing trace with hash -759335625, now seen corresponding path program 536 times [2020-02-10 20:17:28,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:28,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094096042] [2020-02-10 20:17:28,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:28,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:29,016 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 28 [2020-02-10 20:17:29,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:29,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094096042] [2020-02-10 20:17:29,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:29,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:29,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721261319] [2020-02-10 20:17:29,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:29,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:29,023 INFO L87 Difference]: Start difference. First operand 792 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:29,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,189 INFO L93 Difference]: Finished difference Result 1402 states and 4908 transitions. [2020-02-10 20:17:29,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:29,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:29,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,193 INFO L225 Difference]: With dead ends: 1402 [2020-02-10 20:17:29,194 INFO L226 Difference]: Without dead ends: 1387 [2020-02-10 20:17:29,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:29,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1387 states. [2020-02-10 20:17:29,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1387 to 789. [2020-02-10 20:17:29,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:29,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3137 transitions. [2020-02-10 20:17:29,216 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:29,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,216 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3137 transitions. [2020-02-10 20:17:29,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:29,216 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3137 transitions. [2020-02-10 20:17:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:29,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17: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, 1, 1, 1] [2020-02-10 20:17:29,217 INFO L427 AbstractCegarLoop]: === Iteration 544 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,217 INFO L82 PathProgramCache]: Analyzing trace with hash -256955405, now seen corresponding path program 537 times [2020-02-10 20:17:29,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29359458] [2020-02-10 20:17:29,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:29,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:29,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29359458] [2020-02-10 20:17:29,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:29,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:29,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266398203] [2020-02-10 20:17:29,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:29,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:29,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:29,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:29,613 INFO L87 Difference]: Start difference. First operand 789 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:29,764 INFO L93 Difference]: Finished difference Result 1411 states and 4926 transitions. [2020-02-10 20:17:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:29,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:29,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:29,768 INFO L225 Difference]: With dead ends: 1411 [2020-02-10 20:17:29,768 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:17:29,768 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:29,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:17:29,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 794. [2020-02-10 20:17:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:29,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3146 transitions. [2020-02-10 20:17:29,791 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3146 transitions. Word has length 25 [2020-02-10 20:17:29,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:29,791 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3146 transitions. [2020-02-10 20:17:29,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:29,791 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3146 transitions. [2020-02-10 20:17:29,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:29,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:29,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, 1, 1, 1] [2020-02-10 20:17:29,792 INFO L427 AbstractCegarLoop]: === Iteration 545 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:29,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:29,792 INFO L82 PathProgramCache]: Analyzing trace with hash 755308625, now seen corresponding path program 538 times [2020-02-10 20:17:29,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:29,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145805302] [2020-02-10 20:17:29,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:29,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,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 20:17:30,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145805302] [2020-02-10 20:17:30,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:30,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197368528] [2020-02-10 20:17:30,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:30,205 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:30,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:30,205 INFO L87 Difference]: Start difference. First operand 794 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:17:30,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:30,321 INFO L93 Difference]: Finished difference Result 1416 states and 4931 transitions. [2020-02-10 20:17:30,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:30,321 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:30,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:30,325 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:17:30,325 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:17:30,325 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:30,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:17:30,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 789. [2020-02-10 20:17:30,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:30,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3133 transitions. [2020-02-10 20:17:30,348 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3133 transitions. Word has length 25 [2020-02-10 20:17:30,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:30,348 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3133 transitions. [2020-02-10 20:17:30,348 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3133 transitions. [2020-02-10 20:17:30,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:30,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:30,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, 1, 1, 1] [2020-02-10 20:17:30,349 INFO L427 AbstractCegarLoop]: === Iteration 546 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:30,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:30,350 INFO L82 PathProgramCache]: Analyzing trace with hash 556078233, now seen corresponding path program 539 times [2020-02-10 20:17:30,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:30,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040974952] [2020-02-10 20:17:30,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:30,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:30,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040974952] [2020-02-10 20:17:30,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:30,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:30,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975892396] [2020-02-10 20:17:30,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:30,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:30,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:30,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:30,736 INFO L87 Difference]: Start difference. First operand 789 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:17:30,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:30,907 INFO L93 Difference]: Finished difference Result 1408 states and 4915 transitions. [2020-02-10 20:17:30,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:30,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:30,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:30,910 INFO L225 Difference]: With dead ends: 1408 [2020-02-10 20:17:30,910 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:17:30,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:30,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:17:30,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 793. [2020-02-10 20:17:30,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:30,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 20:17:30,932 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:30,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:30,932 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 20:17:30,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:30,933 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 20:17:30,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:30,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:30,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, 1, 1, 1] [2020-02-10 20:17:30,934 INFO L427 AbstractCegarLoop]: === Iteration 547 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:30,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:30,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1093933811, now seen corresponding path program 540 times [2020-02-10 20:17:30,934 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:30,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83867208] [2020-02-10 20:17:30,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:30,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:31,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:31,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83867208] [2020-02-10 20:17:31,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:31,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:31,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183338433] [2020-02-10 20:17:31,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:31,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:31,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:31,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:31,333 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:31,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:31,466 INFO L93 Difference]: Finished difference Result 1414 states and 4923 transitions. [2020-02-10 20:17:31,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:31,467 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:31,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:31,471 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:17:31,471 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:17:31,471 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:31,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:17:31,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 785. [2020-02-10 20:17:31,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:17:31,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3122 transitions. [2020-02-10 20:17:31,492 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3122 transitions. Word has length 25 [2020-02-10 20:17:31,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:31,493 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3122 transitions. [2020-02-10 20:17:31,493 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:31,493 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3122 transitions. [2020-02-10 20:17:31,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:31,494 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:31,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, 1, 1, 1] [2020-02-10 20:17:31,494 INFO L427 AbstractCegarLoop]: === Iteration 548 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:31,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:31,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1267006361, now seen corresponding path program 541 times [2020-02-10 20:17:31,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:31,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997198380] [2020-02-10 20:17:31,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:31,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:31,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997198380] [2020-02-10 20:17:31,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:31,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:31,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790201418] [2020-02-10 20:17:31,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:31,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:31,900 INFO L87 Difference]: Start difference. First operand 785 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:17:32,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:32,039 INFO L93 Difference]: Finished difference Result 1412 states and 4933 transitions. [2020-02-10 20:17:32,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:32,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:32,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:32,042 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:17:32,042 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:17:32,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:32,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:17:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 794. [2020-02-10 20:17:32,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 20:17:32,065 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 20:17:32,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,065 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 20:17:32,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:32,065 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 20:17:32,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:32,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,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, 1, 1, 1] [2020-02-10 20:17:32,066 INFO L427 AbstractCegarLoop]: === Iteration 549 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,066 INFO L82 PathProgramCache]: Analyzing trace with hash -2026200009, now seen corresponding path program 542 times [2020-02-10 20:17:32,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239728516] [2020-02-10 20:17:32,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:32,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:32,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239728516] [2020-02-10 20:17:32,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:32,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:32,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937305360] [2020-02-10 20:17:32,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:32,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:32,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:32,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:32,471 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:17:32,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:32,611 INFO L93 Difference]: Finished difference Result 1413 states and 4931 transitions. [2020-02-10 20:17:32,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:32,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:32,615 INFO L225 Difference]: With dead ends: 1413 [2020-02-10 20:17:32,615 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:17:32,615 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:32,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:17:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 790. [2020-02-10 20:17:32,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:32,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 20:17:32,637 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 20:17:32,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:32,637 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 20:17:32,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 20:17:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:32,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:32,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, 1, 1, 1] [2020-02-10 20:17:32,638 INFO L427 AbstractCegarLoop]: === Iteration 550 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:32,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:32,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1101926857, now seen corresponding path program 543 times [2020-02-10 20:17:32,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:32,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926752165] [2020-02-10 20:17:32,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926752165] [2020-02-10 20:17:33,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:33,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144078692] [2020-02-10 20:17:33,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:33,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:33,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:33,044 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:17:33,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,205 INFO L93 Difference]: Finished difference Result 1417 states and 4938 transitions. [2020-02-10 20:17:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:33,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:33,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,209 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:17:33,209 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:17:33,209 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:33,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:17:33,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 795. [2020-02-10 20:17:33,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:33,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:17:33,231 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:33,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,231 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:17:33,231 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:33,231 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:17:33,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:33,232 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,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, 1, 1, 1] [2020-02-10 20:17:33,232 INFO L427 AbstractCegarLoop]: === Iteration 551 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,232 INFO L82 PathProgramCache]: Analyzing trace with hash -89662827, now seen corresponding path program 544 times [2020-02-10 20:17:33,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876099705] [2020-02-10 20:17:33,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:33,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:33,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876099705] [2020-02-10 20:17:33,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:33,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:33,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809118024] [2020-02-10 20:17:33,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:33,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:33,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:33,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:33,641 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:33,789 INFO L93 Difference]: Finished difference Result 1422 states and 4943 transitions. [2020-02-10 20:17:33,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:33,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:33,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:33,792 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:17:33,793 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:17:33,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:33,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:17:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 790. [2020-02-10 20:17:33,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:17:33,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3131 transitions. [2020-02-10 20:17:33,815 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3131 transitions. Word has length 25 [2020-02-10 20:17:33,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:33,815 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3131 transitions. [2020-02-10 20:17:33,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:33,815 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3131 transitions. [2020-02-10 20:17:33,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:33,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:33,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, 1, 1, 1] [2020-02-10 20:17:33,816 INFO L427 AbstractCegarLoop]: === Iteration 552 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:33,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:33,816 INFO L82 PathProgramCache]: Analyzing trace with hash -710786151, now seen corresponding path program 545 times [2020-02-10 20:17:33,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:33,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682510370] [2020-02-10 20:17:33,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:33,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,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 20:17:34,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682510370] [2020-02-10 20:17:34,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:34,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:34,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114417874] [2020-02-10 20:17:34,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:34,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:34,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:34,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:34,223 INFO L87 Difference]: Start difference. First operand 790 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:17:34,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:34,361 INFO L93 Difference]: Finished difference Result 1420 states and 4940 transitions. [2020-02-10 20:17:34,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:34,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:34,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:34,365 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:17:34,365 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:17:34,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:34,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:17:34,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 796. [2020-02-10 20:17:34,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:17:34,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3142 transitions. [2020-02-10 20:17:34,387 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3142 transitions. Word has length 25 [2020-02-10 20:17:34,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:34,387 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3142 transitions. [2020-02-10 20:17:34,387 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:34,388 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3142 transitions. [2020-02-10 20:17:34,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:34,388 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:34,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, 1, 1, 1] [2020-02-10 20:17:34,389 INFO L427 AbstractCegarLoop]: === Iteration 553 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:34,389 INFO L82 PathProgramCache]: Analyzing trace with hash 900154807, now seen corresponding path program 546 times [2020-02-10 20:17:34,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:34,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509175277] [2020-02-10 20:17:34,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:34,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:34,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509175277] [2020-02-10 20:17:34,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:34,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:34,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148266252] [2020-02-10 20:17:34,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:34,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:34,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:34,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:34,806 INFO L87 Difference]: Start difference. First operand 796 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:17:34,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:34,919 INFO L93 Difference]: Finished difference Result 1424 states and 4942 transitions. [2020-02-10 20:17:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:34,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:34,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:34,923 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:17:34,923 INFO L226 Difference]: Without dead ends: 1395 [2020-02-10 20:17:34,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:34,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1395 states. [2020-02-10 20:17:34,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1395 to 785. [2020-02-10 20:17:34,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:17:34,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3118 transitions. [2020-02-10 20:17:34,945 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3118 transitions. Word has length 25 [2020-02-10 20:17:34,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:34,945 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3118 transitions. [2020-02-10 20:17:34,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:34,945 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3118 transitions. [2020-02-10 20:17:34,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:34,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:34,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, 1, 1, 1] [2020-02-10 20:17:34,946 INFO L427 AbstractCegarLoop]: === Iteration 554 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:34,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:34,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1518875627, now seen corresponding path program 547 times [2020-02-10 20:17:34,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:34,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21526320] [2020-02-10 20:17:34,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,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 20:17:35,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21526320] [2020-02-10 20:17:35,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:35,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931425967] [2020-02-10 20:17:35,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:35,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:35,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:35,349 INFO L87 Difference]: Start difference. First operand 785 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:17:35,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:35,488 INFO L93 Difference]: Finished difference Result 1405 states and 4910 transitions. [2020-02-10 20:17:35,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:35,488 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:35,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:35,492 INFO L225 Difference]: With dead ends: 1405 [2020-02-10 20:17:35,492 INFO L226 Difference]: Without dead ends: 1393 [2020-02-10 20:17:35,492 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:35,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1393 states. [2020-02-10 20:17:35,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1393 to 792. [2020-02-10 20:17:35,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:35,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:17:35,515 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:35,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:35,515 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:17:35,515 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:35,515 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:17:35,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:35,516 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:35,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, 1, 1, 1] [2020-02-10 20:17:35,516 INFO L427 AbstractCegarLoop]: === Iteration 555 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:35,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:35,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1703006289, now seen corresponding path program 548 times [2020-02-10 20:17:35,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:35,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832839956] [2020-02-10 20:17:35,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:35,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:35,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832839956] [2020-02-10 20:17:35,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:35,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:35,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825303851] [2020-02-10 20:17:35,911 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:35,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:35,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:35,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:35,912 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:36,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,045 INFO L93 Difference]: Finished difference Result 1407 states and 4911 transitions. [2020-02-10 20:17:36,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:36,045 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:36,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,049 INFO L225 Difference]: With dead ends: 1407 [2020-02-10 20:17:36,049 INFO L226 Difference]: Without dead ends: 1390 [2020-02-10 20:17:36,049 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2020-02-10 20:17:36,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 789. [2020-02-10 20:17:36,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:36,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 20:17:36,071 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 20:17:36,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,072 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 20:17:36,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:36,072 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 20:17:36,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:36,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,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, 1, 1, 1] [2020-02-10 20:17:36,073 INFO L427 AbstractCegarLoop]: === Iteration 556 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1175653815, now seen corresponding path program 549 times [2020-02-10 20:17:36,073 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101930521] [2020-02-10 20:17:36,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:36,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101930521] [2020-02-10 20:17:36,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:36,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:36,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000342702] [2020-02-10 20:17:36,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:36,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:36,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:36,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:36,462 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:17:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:36,614 INFO L93 Difference]: Finished difference Result 1410 states and 4916 transitions. [2020-02-10 20:17:36,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:36,614 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:36,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:36,617 INFO L225 Difference]: With dead ends: 1410 [2020-02-10 20:17:36,617 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:17:36,618 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:17:36,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 793. [2020-02-10 20:17:36,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:36,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3136 transitions. [2020-02-10 20:17:36,639 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3136 transitions. Word has length 25 [2020-02-10 20:17:36,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:36,640 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3136 transitions. [2020-02-10 20:17:36,640 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:36,640 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3136 transitions. [2020-02-10 20:17:36,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:36,641 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:36,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, 1, 1, 1] [2020-02-10 20:17:36,641 INFO L427 AbstractCegarLoop]: === Iteration 557 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:36,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:36,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1713509393, now seen corresponding path program 550 times [2020-02-10 20:17:36,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:36,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917800113] [2020-02-10 20:17:36,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:36,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917800113] [2020-02-10 20:17:37,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:37,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311202445] [2020-02-10 20:17:37,049 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:37,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:37,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:37,050 INFO L87 Difference]: Start difference. First operand 793 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:17:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,166 INFO L93 Difference]: Finished difference Result 1416 states and 4924 transitions. [2020-02-10 20:17:37,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:37,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,170 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:17:37,170 INFO L226 Difference]: Without dead ends: 1394 [2020-02-10 20:17:37,170 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:37,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1394 states. [2020-02-10 20:17:37,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1394 to 789. [2020-02-10 20:17:37,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:37,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3125 transitions. [2020-02-10 20:17:37,192 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3125 transitions. Word has length 25 [2020-02-10 20:17:37,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,192 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3125 transitions. [2020-02-10 20:17:37,192 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:37,192 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3125 transitions. [2020-02-10 20:17:37,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:37,193 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,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, 1, 1, 1] [2020-02-10 20:17:37,194 INFO L427 AbstractCegarLoop]: === Iteration 558 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1196660023, now seen corresponding path program 551 times [2020-02-10 20:17:37,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015173668] [2020-02-10 20:17:37,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:37,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:37,612 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015173668] [2020-02-10 20:17:37,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:37,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:37,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668113592] [2020-02-10 20:17:37,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:37,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:37,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:37,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:37,612 INFO L87 Difference]: Start difference. First operand 789 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:17:37,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:37,778 INFO L93 Difference]: Finished difference Result 1416 states and 4926 transitions. [2020-02-10 20:17:37,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:37,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:37,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:37,782 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:17:37,782 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:17:37,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:37,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:17:37,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 795. [2020-02-10 20:17:37,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:37,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3136 transitions. [2020-02-10 20:17:37,805 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3136 transitions. Word has length 25 [2020-02-10 20:17:37,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:37,805 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3136 transitions. [2020-02-10 20:17:37,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:37,805 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3136 transitions. [2020-02-10 20:17:37,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:37,806 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:37,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, 1, 1, 1] [2020-02-10 20:17:37,806 INFO L427 AbstractCegarLoop]: === Iteration 559 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:37,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:37,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1487366315, now seen corresponding path program 552 times [2020-02-10 20:17:37,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:37,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120718065] [2020-02-10 20:17:37,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:37,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:38,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120718065] [2020-02-10 20:17:38,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:38,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:38,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485697713] [2020-02-10 20:17:38,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:38,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:38,218 INFO L87 Difference]: Start difference. First operand 795 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:17:38,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,333 INFO L93 Difference]: Finished difference Result 1420 states and 4928 transitions. [2020-02-10 20:17:38,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:38,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:38,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,336 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:17:38,336 INFO L226 Difference]: Without dead ends: 1388 [2020-02-10 20:17:38,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:38,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1388 states. [2020-02-10 20:17:38,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1388 to 781. [2020-02-10 20:17:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:17:38,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:17:38,359 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:17:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,359 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:17:38,359 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:38,359 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:17:38,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:38,360 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,360 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:38,360 INFO L427 AbstractCegarLoop]: === Iteration 560 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,360 INFO L82 PathProgramCache]: Analyzing trace with hash -26211883, now seen corresponding path program 553 times [2020-02-10 20:17:38,361 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524757634] [2020-02-10 20:17:38,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:38,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 20:17:38,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524757634] [2020-02-10 20:17:38,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:38,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:38,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635174081] [2020-02-10 20:17:38,755 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:38,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:38,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:38,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:38,755 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:17:38,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:38,898 INFO L93 Difference]: Finished difference Result 1429 states and 4988 transitions. [2020-02-10 20:17:38,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:38,898 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:38,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:38,902 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:17:38,902 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:17:38,903 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:17:38,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:17:38,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:38,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:17:38,927 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:17:38,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:38,927 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:17:38,927 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:38,927 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:17:38,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:38,928 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:38,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, 1, 1, 1] [2020-02-10 20:17:38,928 INFO L427 AbstractCegarLoop]: === Iteration 561 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:38,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:38,928 INFO L82 PathProgramCache]: Analyzing trace with hash 965045939, now seen corresponding path program 554 times [2020-02-10 20:17:38,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:38,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102236043] [2020-02-10 20:17:38,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102236043] [2020-02-10 20:17:39,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,321 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:39,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330041293] [2020-02-10 20:17:39,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:39,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:39,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:39,322 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:17:39,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:39,464 INFO L93 Difference]: Finished difference Result 1432 states and 4990 transitions. [2020-02-10 20:17:39,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:39,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:39,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:39,468 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:17:39,468 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:17:39,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:39,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:17:39,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 20:17:39,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:39,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3144 transitions. [2020-02-10 20:17:39,490 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3144 transitions. Word has length 25 [2020-02-10 20:17:39,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:39,491 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3144 transitions. [2020-02-10 20:17:39,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:39,491 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3144 transitions. [2020-02-10 20:17:39,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:39,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:39,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, 1, 1, 1] [2020-02-10 20:17:39,492 INFO L427 AbstractCegarLoop]: === Iteration 562 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:39,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:39,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1899822195, now seen corresponding path program 555 times [2020-02-10 20:17:39,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:39,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856235808] [2020-02-10 20:17:39,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:39,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:39,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:39,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856235808] [2020-02-10 20:17:39,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:39,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:39,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205068108] [2020-02-10 20:17:39,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:39,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:39,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:39,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:39,892 INFO L87 Difference]: Start difference. First operand 791 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:17:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,026 INFO L93 Difference]: Finished difference Result 1427 states and 4980 transitions. [2020-02-10 20:17:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:40,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,030 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:17:40,030 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:17:40,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:40,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:17:40,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 795. [2020-02-10 20:17:40,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3151 transitions. [2020-02-10 20:17:40,053 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3151 transitions. Word has length 25 [2020-02-10 20:17:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,053 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3151 transitions. [2020-02-10 20:17:40,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:40,053 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3151 transitions. [2020-02-10 20:17:40,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:40,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,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, 1, 1, 1] [2020-02-10 20:17:40,054 INFO L427 AbstractCegarLoop]: === Iteration 563 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1393384175, now seen corresponding path program 556 times [2020-02-10 20:17:40,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821932014] [2020-02-10 20:17:40,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:40,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:40,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821932014] [2020-02-10 20:17:40,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:40,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:40,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593865600] [2020-02-10 20:17:40,461 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:40,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:40,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:40,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:40,461 INFO L87 Difference]: Start difference. First operand 795 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:17:40,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:40,600 INFO L93 Difference]: Finished difference Result 1428 states and 4978 transitions. [2020-02-10 20:17:40,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:40,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:40,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:40,604 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:17:40,604 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:17:40,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:17:40,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 20:17:40,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:40,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3140 transitions. [2020-02-10 20:17:40,626 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:40,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:40,626 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3140 transitions. [2020-02-10 20:17:40,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:40,626 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3140 transitions. [2020-02-10 20:17:40,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:40,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:40,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:40,628 INFO L427 AbstractCegarLoop]: === Iteration 564 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:40,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:40,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1954863573, now seen corresponding path program 557 times [2020-02-10 20:17:40,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:40,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858973569] [2020-02-10 20:17:40,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858973569] [2020-02-10 20:17:41,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:41,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871082616] [2020-02-10 20:17:41,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:41,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:41,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:41,022 INFO L87 Difference]: Start difference. First operand 791 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,161 INFO L93 Difference]: Finished difference Result 1434 states and 4991 transitions. [2020-02-10 20:17:41,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:41,161 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,165 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:17:41,165 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:17:41,166 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:41,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:17:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 20:17:41,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:17:41,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3149 transitions. [2020-02-10 20:17:41,188 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3149 transitions. Word has length 25 [2020-02-10 20:17:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,188 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3149 transitions. [2020-02-10 20:17:41,188 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3149 transitions. [2020-02-10 20:17:41,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:41,189 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,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, 1, 1, 1] [2020-02-10 20:17:41,190 INFO L427 AbstractCegarLoop]: === Iteration 565 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,190 INFO L82 PathProgramCache]: Analyzing trace with hash -729162765, now seen corresponding path program 558 times [2020-02-10 20:17:41,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325715843] [2020-02-10 20:17:41,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:41,597 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:17:41,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:41,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325715843] [2020-02-10 20:17:41,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:41,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:41,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59156695] [2020-02-10 20:17:41,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:41,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:41,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:41,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:41,604 INFO L87 Difference]: Start difference. First operand 796 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:17:41,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:41,741 INFO L93 Difference]: Finished difference Result 1432 states and 4982 transitions. [2020-02-10 20:17:41,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:41,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:41,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:41,745 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:17:41,745 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:17:41,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:41,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:17:41,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 787. [2020-02-10 20:17:41,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:41,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3129 transitions. [2020-02-10 20:17:41,768 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3129 transitions. Word has length 25 [2020-02-10 20:17:41,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:41,768 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3129 transitions. [2020-02-10 20:17:41,768 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:41,768 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3129 transitions. [2020-02-10 20:17:41,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:41,769 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:41,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, 1, 1, 1] [2020-02-10 20:17:41,770 INFO L427 AbstractCegarLoop]: === Iteration 566 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:41,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:41,770 INFO L82 PathProgramCache]: Analyzing trace with hash -448697609, now seen corresponding path program 559 times [2020-02-10 20:17:41,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:41,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889096423] [2020-02-10 20:17:41,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:42,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:42,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889096423] [2020-02-10 20:17:42,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:42,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:42,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234434905] [2020-02-10 20:17:42,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:42,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:42,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:42,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:42,179 INFO L87 Difference]: Start difference. First operand 787 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:17:42,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:42,346 INFO L93 Difference]: Finished difference Result 1440 states and 5007 transitions. [2020-02-10 20:17:42,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:42,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:42,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:42,350 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:17:42,350 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:17:42,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:42,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:17:42,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 797. [2020-02-10 20:17:42,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:17:42,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3156 transitions. [2020-02-10 20:17:42,373 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3156 transitions. Word has length 25 [2020-02-10 20:17:42,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,373 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3156 transitions. [2020-02-10 20:17:42,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:42,373 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3156 transitions. [2020-02-10 20:17:42,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:42,374 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,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, 1, 1, 1] [2020-02-10 20:17:42,374 INFO L427 AbstractCegarLoop]: === Iteration 567 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,375 INFO L82 PathProgramCache]: Analyzing trace with hash 542560213, now seen corresponding path program 560 times [2020-02-10 20:17:42,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650392937] [2020-02-10 20:17:42,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:42,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:42,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650392937] [2020-02-10 20:17:42,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:42,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:42,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667526732] [2020-02-10 20:17:42,769 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:42,769 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:42,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:42,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:42,770 INFO L87 Difference]: Start difference. First operand 797 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:17:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:42,907 INFO L93 Difference]: Finished difference Result 1443 states and 5009 transitions. [2020-02-10 20:17:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:42,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:42,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:42,911 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:17:42,911 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:17:42,911 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:42,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:17:42,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 793. [2020-02-10 20:17:42,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:42,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3145 transitions. [2020-02-10 20:17:42,934 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:42,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:42,934 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3145 transitions. [2020-02-10 20:17:42,934 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:42,934 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3145 transitions. [2020-02-10 20:17:42,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:42,935 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:42,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, 1, 1, 1] [2020-02-10 20:17:42,935 INFO L427 AbstractCegarLoop]: === Iteration 568 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:42,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:42,935 INFO L82 PathProgramCache]: Analyzing trace with hash -891596749, now seen corresponding path program 561 times [2020-02-10 20:17:42,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:42,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804955779] [2020-02-10 20:17:42,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:42,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804955779] [2020-02-10 20:17:43,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:43,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347153822] [2020-02-10 20:17:43,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:43,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:43,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:43,339 INFO L87 Difference]: Start difference. First operand 793 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:43,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:43,482 INFO L93 Difference]: Finished difference Result 1443 states and 5008 transitions. [2020-02-10 20:17:43,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:43,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:43,486 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:17:43,487 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:17:43,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:17:43,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 20:17:43,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:17:43,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3154 transitions. [2020-02-10 20:17:43,509 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3154 transitions. Word has length 25 [2020-02-10 20:17:43,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:43,509 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3154 transitions. [2020-02-10 20:17:43,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:43,510 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3154 transitions. [2020-02-10 20:17:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:43,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:43,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, 1, 1, 1] [2020-02-10 20:17:43,511 INFO L427 AbstractCegarLoop]: === Iteration 569 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:43,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:43,511 INFO L82 PathProgramCache]: Analyzing trace with hash 120667281, now seen corresponding path program 562 times [2020-02-10 20:17:43,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:43,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481428731] [2020-02-10 20:17:43,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:43,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:43,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481428731] [2020-02-10 20:17:43,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:43,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:43,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611972361] [2020-02-10 20:17:43,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:43,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:43,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:43,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:43,919 INFO L87 Difference]: Start difference. First operand 798 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:17:44,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:44,039 INFO L93 Difference]: Finished difference Result 1448 states and 5013 transitions. [2020-02-10 20:17:44,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:44,039 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:44,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:44,042 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:17:44,042 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:17:44,043 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:44,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:17:44,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 793. [2020-02-10 20:17:44,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:44,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3140 transitions. [2020-02-10 20:17:44,065 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:44,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:44,065 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3140 transitions. [2020-02-10 20:17:44,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:44,065 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3140 transitions. [2020-02-10 20:17:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:44,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:44,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, 1, 1, 1] [2020-02-10 20:17:44,066 INFO L427 AbstractCegarLoop]: === Iteration 570 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:44,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:44,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1857974071, now seen corresponding path program 563 times [2020-02-10 20:17:44,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:44,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622010963] [2020-02-10 20:17:44,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:44,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:44,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622010963] [2020-02-10 20:17:44,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:44,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:44,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523566861] [2020-02-10 20:17:44,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:44,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:44,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:44,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:44,481 INFO L87 Difference]: Start difference. First operand 793 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:44,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:44,633 INFO L93 Difference]: Finished difference Result 1453 states and 5025 transitions. [2020-02-10 20:17:44,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:44,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:44,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:44,637 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:17:44,638 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:17:44,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:44,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:17:44,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 802. [2020-02-10 20:17:44,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:17:44,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3156 transitions. [2020-02-10 20:17:44,661 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3156 transitions. Word has length 25 [2020-02-10 20:17:44,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:44,661 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3156 transitions. [2020-02-10 20:17:44,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:44,661 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3156 transitions. [2020-02-10 20:17:44,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:44,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:44,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, 1, 1, 1] [2020-02-10 20:17:44,662 INFO L427 AbstractCegarLoop]: === Iteration 571 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:44,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:44,663 INFO L82 PathProgramCache]: Analyzing trace with hash 784888691, now seen corresponding path program 564 times [2020-02-10 20:17:44,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:44,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013624167] [2020-02-10 20:17:44,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:44,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:45,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:45,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013624167] [2020-02-10 20:17:45,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:45,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:45,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293215448] [2020-02-10 20:17:45,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:45,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:45,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:45,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:45,088 INFO L87 Difference]: Start difference. First operand 802 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:17:45,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,215 INFO L93 Difference]: Finished difference Result 1455 states and 5021 transitions. [2020-02-10 20:17:45,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:45,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:45,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,219 INFO L225 Difference]: With dead ends: 1455 [2020-02-10 20:17:45,219 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:17:45,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:45,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:17:45,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 787. [2020-02-10 20:17:45,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:45,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3123 transitions. [2020-02-10 20:17:45,242 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3123 transitions. Word has length 25 [2020-02-10 20:17:45,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,242 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3123 transitions. [2020-02-10 20:17:45,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:45,242 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3123 transitions. [2020-02-10 20:17:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:45,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,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, 1, 1, 1] [2020-02-10 20:17:45,244 INFO L427 AbstractCegarLoop]: === Iteration 572 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1054850743, now seen corresponding path program 565 times [2020-02-10 20:17:45,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518909653] [2020-02-10 20:17:45,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:45,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:45,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518909653] [2020-02-10 20:17:45,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:45,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:45,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146227941] [2020-02-10 20:17:45,650 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:45,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:45,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:45,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:45,650 INFO L87 Difference]: Start difference. First operand 787 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:17:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:45,800 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 20:17:45,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:45,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:45,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:45,820 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:17:45,821 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:17:45,821 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:45,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:17:45,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 20:17:45,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:17:45,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3148 transitions. [2020-02-10 20:17:45,842 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3148 transitions. Word has length 25 [2020-02-10 20:17:45,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:45,842 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3148 transitions. [2020-02-10 20:17:45,842 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:45,842 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3148 transitions. [2020-02-10 20:17:45,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:45,843 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:45,843 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:45,843 INFO L427 AbstractCegarLoop]: === Iteration 573 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:45,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:45,844 INFO L82 PathProgramCache]: Analyzing trace with hash 2056611669, now seen corresponding path program 566 times [2020-02-10 20:17:45,844 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:45,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418001455] [2020-02-10 20:17:45,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:45,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418001455] [2020-02-10 20:17:46,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:46,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27366148] [2020-02-10 20:17:46,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:46,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:46,248 INFO L87 Difference]: Start difference. First operand 796 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:17:46,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:46,423 INFO L93 Difference]: Finished difference Result 1433 states and 4982 transitions. [2020-02-10 20:17:46,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:46,424 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:46,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:46,427 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:17:46,427 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:17:46,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:17:46,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 792. [2020-02-10 20:17:46,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:46,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:17:46,449 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:46,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:46,450 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:17:46,450 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:46,450 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:17:46,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:46,451 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:46,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, 1, 1, 1] [2020-02-10 20:17:46,451 INFO L427 AbstractCegarLoop]: === Iteration 574 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:46,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:46,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1314082475, now seen corresponding path program 567 times [2020-02-10 20:17:46,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:46,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168855394] [2020-02-10 20:17:46,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:46,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:46,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168855394] [2020-02-10 20:17:46,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:46,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:46,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78014554] [2020-02-10 20:17:46,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:46,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:46,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:46,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:46,848 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:47,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,002 INFO L93 Difference]: Finished difference Result 1437 states and 4989 transitions. [2020-02-10 20:17:47,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:47,002 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:47,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,005 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:17:47,006 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:17:47,006 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:17:47,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 797. [2020-02-10 20:17:47,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:17:47,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3146 transitions. [2020-02-10 20:17:47,028 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3146 transitions. Word has length 25 [2020-02-10 20:17:47,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,028 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3146 transitions. [2020-02-10 20:17:47,028 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:47,028 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3146 transitions. [2020-02-10 20:17:47,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:47,029 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,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, 1, 1, 1] [2020-02-10 20:17:47,029 INFO L427 AbstractCegarLoop]: === Iteration 575 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,030 INFO L82 PathProgramCache]: Analyzing trace with hash -301818445, now seen corresponding path program 568 times [2020-02-10 20:17:47,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169562355] [2020-02-10 20:17:47,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:47,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 20:17:47,435 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169562355] [2020-02-10 20:17:47,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:47,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:47,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918159292] [2020-02-10 20:17:47,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:47,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:47,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:47,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:47,436 INFO L87 Difference]: Start difference. First operand 797 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:17:47,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:47,555 INFO L93 Difference]: Finished difference Result 1442 states and 4994 transitions. [2020-02-10 20:17:47,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:47,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:47,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:47,559 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:17:47,560 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:17:47,560 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:17:47,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 792. [2020-02-10 20:17:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3132 transitions. [2020-02-10 20:17:47,582 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3132 transitions. Word has length 25 [2020-02-10 20:17:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:47,583 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3132 transitions. [2020-02-10 20:17:47,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3132 transitions. [2020-02-10 20:17:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:47,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:47,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, 1, 1, 1] [2020-02-10 20:17:47,584 INFO L427 AbstractCegarLoop]: === Iteration 576 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:47,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash -922941769, now seen corresponding path program 569 times [2020-02-10 20:17:47,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:47,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835766195] [2020-02-10 20:17:47,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835766195] [2020-02-10 20:17:48,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:48,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994663020] [2020-02-10 20:17:48,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:48,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:48,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:48,021 INFO L87 Difference]: Start difference. First operand 792 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:17:48,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:48,164 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 20:17:48,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:48,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:48,168 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:17:48,168 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:17:48,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:48,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:17:48,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 798. [2020-02-10 20:17:48,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:17:48,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3143 transitions. [2020-02-10 20:17:48,190 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3143 transitions. Word has length 25 [2020-02-10 20:17:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:48,190 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3143 transitions. [2020-02-10 20:17:48,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3143 transitions. [2020-02-10 20:17:48,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:48,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:48,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, 1, 1, 1] [2020-02-10 20:17:48,191 INFO L427 AbstractCegarLoop]: === Iteration 577 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:48,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:48,192 INFO L82 PathProgramCache]: Analyzing trace with hash 687999189, now seen corresponding path program 570 times [2020-02-10 20:17:48,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:48,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469043413] [2020-02-10 20:17:48,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:48,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:48,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469043413] [2020-02-10 20:17:48,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:48,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:48,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036126409] [2020-02-10 20:17:48,607 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:48,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:48,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:48,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:48,608 INFO L87 Difference]: Start difference. First operand 798 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:17:48,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:48,777 INFO L93 Difference]: Finished difference Result 1444 states and 4993 transitions. [2020-02-10 20:17:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:48,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:48,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:48,781 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:17:48,781 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:17:48,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:48,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:17:48,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 787. [2020-02-10 20:17:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:17:48,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3118 transitions. [2020-02-10 20:17:48,803 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3118 transitions. Word has length 25 [2020-02-10 20:17:48,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:48,803 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3118 transitions. [2020-02-10 20:17:48,804 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:48,804 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3118 transitions. [2020-02-10 20:17:48,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:48,805 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:48,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, 1, 1, 1] [2020-02-10 20:17:48,805 INFO L427 AbstractCegarLoop]: === Iteration 578 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:48,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:48,805 INFO L82 PathProgramCache]: Analyzing trace with hash -216979789, now seen corresponding path program 571 times [2020-02-10 20:17:48,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:48,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686521236] [2020-02-10 20:17:48,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686521236] [2020-02-10 20:17:49,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:49,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502862164] [2020-02-10 20:17:49,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:49,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:49,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:49,205 INFO L87 Difference]: Start difference. First operand 787 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:17:49,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,354 INFO L93 Difference]: Finished difference Result 1449 states and 5019 transitions. [2020-02-10 20:17:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:49,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:49,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,358 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:17:49,358 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:17:49,359 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:49,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:17:49,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 799. [2020-02-10 20:17:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:17:49,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3151 transitions. [2020-02-10 20:17:49,381 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3151 transitions. Word has length 25 [2020-02-10 20:17:49,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,381 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3151 transitions. [2020-02-10 20:17:49,381 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:49,381 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3151 transitions. [2020-02-10 20:17:49,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:49,382 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,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, 1, 1, 1] [2020-02-10 20:17:49,383 INFO L427 AbstractCegarLoop]: === Iteration 579 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,383 INFO L82 PathProgramCache]: Analyzing trace with hash 1393961169, now seen corresponding path program 572 times [2020-02-10 20:17:49,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658390914] [2020-02-10 20:17:49,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:49,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:49,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658390914] [2020-02-10 20:17:49,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:49,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:49,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771222868] [2020-02-10 20:17:49,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:49,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:49,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:49,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:49,779 INFO L87 Difference]: Start difference. First operand 799 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:17:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:49,943 INFO L93 Difference]: Finished difference Result 1447 states and 5010 transitions. [2020-02-10 20:17:49,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:49,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:49,947 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:17:49,947 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:17:49,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:49,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:17:49,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 794. [2020-02-10 20:17:49,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:49,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:17:49,970 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:49,970 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:17:49,970 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:17:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:49,971 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:49,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, 1, 1, 1] [2020-02-10 20:17:49,971 INFO L427 AbstractCegarLoop]: === Iteration 580 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:49,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:49,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1817417643, now seen corresponding path program 573 times [2020-02-10 20:17:49,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:49,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448710647] [2020-02-10 20:17:49,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:50,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:50,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448710647] [2020-02-10 20:17:50,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:50,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:50,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152580627] [2020-02-10 20:17:50,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:50,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:50,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:50,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:50,387 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:50,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:50,578 INFO L93 Difference]: Finished difference Result 1457 states and 5030 transitions. [2020-02-10 20:17:50,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:50,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:50,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:50,582 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:17:50,582 INFO L226 Difference]: Without dead ends: 1441 [2020-02-10 20:17:50,582 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:50,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1441 states. [2020-02-10 20:17:50,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1441 to 803. [2020-02-10 20:17:50,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:17:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3153 transitions. [2020-02-10 20:17:50,605 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3153 transitions. Word has length 25 [2020-02-10 20:17:50,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:50,605 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3153 transitions. [2020-02-10 20:17:50,606 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3153 transitions. [2020-02-10 20:17:50,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:50,607 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:50,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, 1, 1, 1] [2020-02-10 20:17:50,607 INFO L427 AbstractCegarLoop]: === Iteration 581 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:50,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1404464273, now seen corresponding path program 574 times [2020-02-10 20:17:50,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:50,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315530826] [2020-02-10 20:17:50,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:50,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315530826] [2020-02-10 20:17:51,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:51,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829039011] [2020-02-10 20:17:51,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:51,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:51,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:51,022 INFO L87 Difference]: Start difference. First operand 803 states and 3153 transitions. Second operand 10 states. [2020-02-10 20:17:51,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,155 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 20:17:51,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:51,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:51,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,159 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:17:51,159 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:17:51,159 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:51,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:17:51,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 794. [2020-02-10 20:17:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3130 transitions. [2020-02-10 20:17:51,182 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3130 transitions. Word has length 25 [2020-02-10 20:17:51,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,182 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3130 transitions. [2020-02-10 20:17:51,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:51,182 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3130 transitions. [2020-02-10 20:17:51,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:51,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,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, 1, 1, 1] [2020-02-10 20:17:51,183 INFO L427 AbstractCegarLoop]: === Iteration 582 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1806914539, now seen corresponding path program 575 times [2020-02-10 20:17:51,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049911938] [2020-02-10 20:17:51,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:51,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049911938] [2020-02-10 20:17:51,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:51,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:51,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931205536] [2020-02-10 20:17:51,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:51,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:51,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:51,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:51,600 INFO L87 Difference]: Start difference. First operand 794 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:17:51,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:51,754 INFO L93 Difference]: Finished difference Result 1450 states and 5008 transitions. [2020-02-10 20:17:51,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:51,754 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:51,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:51,758 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:17:51,758 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:17:51,758 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:17:51,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 800. [2020-02-10 20:17:51,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:17:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 20:17:51,781 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 20:17:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:51,781 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 20:17:51,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:51,781 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 20:17:51,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:51,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:51,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, 1, 1, 1] [2020-02-10 20:17:51,782 INFO L427 AbstractCegarLoop]: === Iteration 583 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:51,782 INFO L82 PathProgramCache]: Analyzing trace with hash -195973581, now seen corresponding path program 576 times [2020-02-10 20:17:51,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:51,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406191963] [2020-02-10 20:17:51,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:51,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406191963] [2020-02-10 20:17:52,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:52,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65826769] [2020-02-10 20:17:52,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:52,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:52,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:52,193 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:17:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:52,326 INFO L93 Difference]: Finished difference Result 1454 states and 5010 transitions. [2020-02-10 20:17:52,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:52,327 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:52,330 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:17:52,331 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:17:52,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:52,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:17:52,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 781. [2020-02-10 20:17:52,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:17:52,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:17:52,353 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:17:52,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:52,353 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:17:52,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:52,353 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:17:52,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:52,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:52,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, 1, 1, 1] [2020-02-10 20:17:52,354 INFO L427 AbstractCegarLoop]: === Iteration 584 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:52,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:52,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1108890727, now seen corresponding path program 577 times [2020-02-10 20:17:52,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:52,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564727444] [2020-02-10 20:17:52,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:52,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:52,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:52,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564727444] [2020-02-10 20:17:52,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:52,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:52,739 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959380533] [2020-02-10 20:17:52,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:52,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:52,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:52,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:52,739 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:17:52,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:52,906 INFO L93 Difference]: Finished difference Result 1414 states and 4936 transitions. [2020-02-10 20:17:52,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:52,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:52,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:52,910 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:17:52,910 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:17:52,910 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:52,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:17:52,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 20:17:52,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:52,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3139 transitions. [2020-02-10 20:17:52,933 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3139 transitions. Word has length 25 [2020-02-10 20:17:52,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:52,933 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3139 transitions. [2020-02-10 20:17:52,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:52,934 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3139 transitions. [2020-02-10 20:17:52,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:52,934 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:52,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, 1, 1, 1] [2020-02-10 20:17:52,935 INFO L427 AbstractCegarLoop]: === Iteration 585 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:52,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 502050231, now seen corresponding path program 578 times [2020-02-10 20:17:52,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:52,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021056793] [2020-02-10 20:17:52,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,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 20:17:53,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021056793] [2020-02-10 20:17:53,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:53,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485935131] [2020-02-10 20:17:53,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:53,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:53,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:53,317 INFO L87 Difference]: Start difference. First operand 792 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:17:53,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:53,486 INFO L93 Difference]: Finished difference Result 1418 states and 4941 transitions. [2020-02-10 20:17:53,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:53,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:53,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:53,490 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:17:53,490 INFO L226 Difference]: Without dead ends: 1399 [2020-02-10 20:17:53,490 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:53,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1399 states. [2020-02-10 20:17:53,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1399 to 789. [2020-02-10 20:17:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3131 transitions. [2020-02-10 20:17:53,512 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3131 transitions. Word has length 25 [2020-02-10 20:17:53,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:53,512 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3131 transitions. [2020-02-10 20:17:53,512 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:53,512 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3131 transitions. [2020-02-10 20:17:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:53,513 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:53,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, 1, 1, 1] [2020-02-10 20:17:53,513 INFO L427 AbstractCegarLoop]: === Iteration 586 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:53,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1585638715, now seen corresponding path program 579 times [2020-02-10 20:17:53,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:53,514 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304816663] [2020-02-10 20:17:53,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:53,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:53,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 20:17:53,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304816663] [2020-02-10 20:17:53,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:53,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:53,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696598972] [2020-02-10 20:17:53,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:53,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:53,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:53,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:53,920 INFO L87 Difference]: Start difference. First operand 789 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:17:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:54,086 INFO L93 Difference]: Finished difference Result 1412 states and 4929 transitions. [2020-02-10 20:17:54,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:54,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:54,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:54,090 INFO L225 Difference]: With dead ends: 1412 [2020-02-10 20:17:54,091 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:17:54,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:54,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:17:54,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 792. [2020-02-10 20:17:54,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:17:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3136 transitions. [2020-02-10 20:17:54,113 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3136 transitions. Word has length 25 [2020-02-10 20:17:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:54,113 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3136 transitions. [2020-02-10 20:17:54,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3136 transitions. [2020-02-10 20:17:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:54,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:54,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, 1, 1, 1] [2020-02-10 20:17:54,115 INFO L427 AbstractCegarLoop]: === Iteration 587 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:54,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:54,115 INFO L82 PathProgramCache]: Analyzing trace with hash 512553335, now seen corresponding path program 580 times [2020-02-10 20:17:54,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:54,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518920395] [2020-02-10 20:17:54,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:54,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:54,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518920395] [2020-02-10 20:17:54,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:54,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:54,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271471349] [2020-02-10 20:17:54,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:54,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:54,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:54,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:54,496 INFO L87 Difference]: Start difference. First operand 792 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:17:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:54,665 INFO L93 Difference]: Finished difference Result 1414 states and 4930 transitions. [2020-02-10 20:17:54,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:54,665 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:54,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:54,669 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:17:54,669 INFO L226 Difference]: Without dead ends: 1397 [2020-02-10 20:17:54,669 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:54,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2020-02-10 20:17:54,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 789. [2020-02-10 20:17:54,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:17:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3128 transitions. [2020-02-10 20:17:54,693 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3128 transitions. Word has length 25 [2020-02-10 20:17:54,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:54,693 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3128 transitions. [2020-02-10 20:17:54,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3128 transitions. [2020-02-10 20:17:54,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:54,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:54,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:54,694 INFO L427 AbstractCegarLoop]: === Iteration 588 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:54,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:54,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1596141819, now seen corresponding path program 581 times [2020-02-10 20:17:54,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:54,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923726735] [2020-02-10 20:17:54,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:54,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923726735] [2020-02-10 20:17:55,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:55,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913587183] [2020-02-10 20:17:55,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:55,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:55,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:55,082 INFO L87 Difference]: Start difference. First operand 789 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:17:55,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,241 INFO L93 Difference]: Finished difference Result 1422 states and 4948 transitions. [2020-02-10 20:17:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:55,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:55,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,244 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:17:55,244 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:17:55,245 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:55,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:17:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 794. [2020-02-10 20:17:55,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:55,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3137 transitions. [2020-02-10 20:17:55,268 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3137 transitions. Word has length 25 [2020-02-10 20:17:55,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,268 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3137 transitions. [2020-02-10 20:17:55,268 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:55,268 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3137 transitions. [2020-02-10 20:17:55,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:55,269 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,269 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:55,269 INFO L427 AbstractCegarLoop]: === Iteration 589 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1087884519, now seen corresponding path program 582 times [2020-02-10 20:17:55,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369256826] [2020-02-10 20:17:55,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:55,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:55,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369256826] [2020-02-10 20:17:55,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:55,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:55,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215147624] [2020-02-10 20:17:55,657 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:55,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:55,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:55,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:55,658 INFO L87 Difference]: Start difference. First operand 794 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:17:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:55,801 INFO L93 Difference]: Finished difference Result 1420 states and 4939 transitions. [2020-02-10 20:17:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:55,802 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:55,805 INFO L225 Difference]: With dead ends: 1420 [2020-02-10 20:17:55,805 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:17:55,805 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:55,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:17:55,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 786. [2020-02-10 20:17:55,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:17:55,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 20:17:55,827 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 20:17:55,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:55,827 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 20:17:55,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 20:17:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:55,828 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:55,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, 1, 1, 1] [2020-02-10 20:17:55,828 INFO L427 AbstractCegarLoop]: === Iteration 590 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:55,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:55,828 INFO L82 PathProgramCache]: Analyzing trace with hash 817143351, now seen corresponding path program 583 times [2020-02-10 20:17:55,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:55,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880416030] [2020-02-10 20:17:55,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:55,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880416030] [2020-02-10 20:17:56,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:56,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034786919] [2020-02-10 20:17:56,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:56,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:56,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:56,241 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:17:56,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:56,385 INFO L93 Difference]: Finished difference Result 1425 states and 4956 transitions. [2020-02-10 20:17:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:56,386 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:56,389 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:17:56,389 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:17:56,390 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:17:56,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 794. [2020-02-10 20:17:56,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:17:56,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3141 transitions. [2020-02-10 20:17:56,412 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3141 transitions. Word has length 25 [2020-02-10 20:17:56,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:56,412 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3141 transitions. [2020-02-10 20:17:56,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:56,413 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3141 transitions. [2020-02-10 20:17:56,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:56,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:56,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, 1, 1, 1] [2020-02-10 20:17:56,414 INFO L427 AbstractCegarLoop]: === Iteration 591 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:56,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:56,414 INFO L82 PathProgramCache]: Analyzing trace with hash -1866882987, now seen corresponding path program 584 times [2020-02-10 20:17:56,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:56,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649974652] [2020-02-10 20:17:56,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:56,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:56,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649974652] [2020-02-10 20:17:56,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:56,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:56,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003445171] [2020-02-10 20:17:56,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:56,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:56,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:56,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:56,797 INFO L87 Difference]: Start difference. First operand 794 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:17:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:56,928 INFO L93 Difference]: Finished difference Result 1429 states and 4961 transitions. [2020-02-10 20:17:56,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:56,929 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:56,932 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:17:56,932 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:17:56,933 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:56,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:17:56,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 791. [2020-02-10 20:17:56,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3133 transitions. [2020-02-10 20:17:56,954 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3133 transitions. Word has length 25 [2020-02-10 20:17:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:56,955 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3133 transitions. [2020-02-10 20:17:56,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:56,955 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3133 transitions. [2020-02-10 20:17:56,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:56,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:56,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, 1, 1, 1] [2020-02-10 20:17:56,956 INFO L427 AbstractCegarLoop]: === Iteration 592 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:56,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:56,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1911234939, now seen corresponding path program 585 times [2020-02-10 20:17:56,956 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:56,956 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897876183] [2020-02-10 20:17:56,956 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:56,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:57,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:57,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897876183] [2020-02-10 20:17:57,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:57,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:57,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186644650] [2020-02-10 20:17:57,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:57,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:57,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:57,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:57,339 INFO L87 Difference]: Start difference. First operand 791 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:17:57,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:57,470 INFO L93 Difference]: Finished difference Result 1428 states and 4958 transitions. [2020-02-10 20:17:57,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:57,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:57,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:57,475 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:17:57,475 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:17:57,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:17:57,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:17:57,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:17:57,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3140 transitions. [2020-02-10 20:17:57,513 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3140 transitions. Word has length 25 [2020-02-10 20:17:57,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:57,513 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3140 transitions. [2020-02-10 20:17:57,514 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:57,514 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3140 transitions. [2020-02-10 20:17:57,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:57,515 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:57,515 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:17:57,515 INFO L427 AbstractCegarLoop]: === Iteration 593 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:57,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:57,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1845876779, now seen corresponding path program 586 times [2020-02-10 20:17:57,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:57,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411707672] [2020-02-10 20:17:57,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:57,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:57,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:57,908 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411707672] [2020-02-10 20:17:57,908 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:57,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:57,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666540557] [2020-02-10 20:17:57,909 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:57,909 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:57,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:57,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:57,909 INFO L87 Difference]: Start difference. First operand 795 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:17:58,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:58,037 INFO L93 Difference]: Finished difference Result 1434 states and 4966 transitions. [2020-02-10 20:17:58,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:58,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:58,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:58,042 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:17:58,042 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:17:58,042 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:58,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:17:58,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 791. [2020-02-10 20:17:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:17:58,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3129 transitions. [2020-02-10 20:17:58,065 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3129 transitions. Word has length 25 [2020-02-10 20:17:58,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:58,065 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3129 transitions. [2020-02-10 20:17:58,065 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3129 transitions. [2020-02-10 20:17:58,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:58,066 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:58,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, 1, 1, 1] [2020-02-10 20:17:58,066 INFO L427 AbstractCegarLoop]: === Iteration 594 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:58,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:58,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1921738043, now seen corresponding path program 587 times [2020-02-10 20:17:58,067 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:58,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962256320] [2020-02-10 20:17:58,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:58,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17: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 20:17:58,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962256320] [2020-02-10 20:17:58,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:58,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:58,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771534955] [2020-02-10 20:17:58,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:58,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:58,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:58,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:58,462 INFO L87 Difference]: Start difference. First operand 791 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:17:58,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:58,615 INFO L93 Difference]: Finished difference Result 1441 states and 4983 transitions. [2020-02-10 20:17:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:58,615 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:58,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:58,618 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:17:58,619 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:17:58,619 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:58,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:17:58,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 800. [2020-02-10 20:17:58,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:17:58,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3145 transitions. [2020-02-10 20:17:58,641 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3145 transitions. Word has length 25 [2020-02-10 20:17:58,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:58,641 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3145 transitions. [2020-02-10 20:17:58,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:58,641 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3145 transitions. [2020-02-10 20:17:58,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:58,642 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:58,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, 1, 1, 1] [2020-02-10 20:17:58,642 INFO L427 AbstractCegarLoop]: === Iteration 595 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:58,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:58,643 INFO L82 PathProgramCache]: Analyzing trace with hash 848652663, now seen corresponding path program 588 times [2020-02-10 20:17:58,643 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:58,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268221828] [2020-02-10 20:17:58,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:58,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:17:59,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268221828] [2020-02-10 20:17:59,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:59,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75237951] [2020-02-10 20:17:59,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:59,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:59,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:59,054 INFO L87 Difference]: Start difference. First operand 800 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:17:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,171 INFO L93 Difference]: Finished difference Result 1443 states and 4979 transitions. [2020-02-10 20:17:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:59,171 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:59,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,175 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:17:59,175 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:17:59,175 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:59,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:17:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 786. [2020-02-10 20:17:59,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:17:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3115 transitions. [2020-02-10 20:17:59,197 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3115 transitions. Word has length 25 [2020-02-10 20:17:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,197 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3115 transitions. [2020-02-10 20:17:59,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3115 transitions. [2020-02-10 20:17:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:59,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,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, 1, 1, 1] [2020-02-10 20:17:59,198 INFO L427 AbstractCegarLoop]: === Iteration 596 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,198 INFO L82 PathProgramCache]: Analyzing trace with hash 1142739575, now seen corresponding path program 589 times [2020-02-10 20:17:59,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497983090] [2020-02-10 20:17:59,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:17:59,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 20:17:59,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497983090] [2020-02-10 20:17:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:17:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:17:59,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947496514] [2020-02-10 20:17:59,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:17:59,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:17:59,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:17:59,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:17:59,583 INFO L87 Difference]: Start difference. First operand 786 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:17:59,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:17:59,746 INFO L93 Difference]: Finished difference Result 1417 states and 4934 transitions. [2020-02-10 20:17:59,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:17:59,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:17:59,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:17:59,750 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:17:59,750 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:17:59,750 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:17:59,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:17:59,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 793. [2020-02-10 20:17:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:17:59,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3134 transitions. [2020-02-10 20:17:59,773 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3134 transitions. Word has length 25 [2020-02-10 20:17:59,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:17:59,773 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3134 transitions. [2020-02-10 20:17:59,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:17:59,773 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3134 transitions. [2020-02-10 20:17:59,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:17:59,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:17:59,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, 1, 1, 1] [2020-02-10 20:17:59,777 INFO L427 AbstractCegarLoop]: === Iteration 597 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:17:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:17:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash 69654195, now seen corresponding path program 590 times [2020-02-10 20:17:59,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:17:59,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143074628] [2020-02-10 20:17:59,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:17:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143074628] [2020-02-10 20:18:00,183 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,183 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:00,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654923002] [2020-02-10 20:18:00,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:00,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:00,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:00,184 INFO L87 Difference]: Start difference. First operand 793 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:18:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:00,319 INFO L93 Difference]: Finished difference Result 1419 states and 4935 transitions. [2020-02-10 20:18:00,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:00,319 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:00,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:00,323 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:18:00,323 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:18:00,323 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:18:00,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 790. [2020-02-10 20:18:00,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:18:00,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3126 transitions. [2020-02-10 20:18:00,346 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3126 transitions. Word has length 25 [2020-02-10 20:18:00,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:00,346 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3126 transitions. [2020-02-10 20:18:00,346 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:00,346 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3126 transitions. [2020-02-10 20:18:00,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:00,347 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:00,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, 1, 1, 1] [2020-02-10 20:18:00,347 INFO L427 AbstractCegarLoop]: === Iteration 598 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:00,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:00,348 INFO L82 PathProgramCache]: Analyzing trace with hash -457698279, now seen corresponding path program 591 times [2020-02-10 20:18:00,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:00,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567070573] [2020-02-10 20:18:00,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:00,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:00,727 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567070573] [2020-02-10 20:18:00,727 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:00,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:00,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104750603] [2020-02-10 20:18:00,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:00,728 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:00,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:00,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:00,728 INFO L87 Difference]: Start difference. First operand 790 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:18:00,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:00,873 INFO L93 Difference]: Finished difference Result 1422 states and 4940 transitions. [2020-02-10 20:18:00,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:00,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:00,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:00,876 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:18:00,877 INFO L226 Difference]: Without dead ends: 1410 [2020-02-10 20:18:00,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:00,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2020-02-10 20:18:00,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 794. [2020-02-10 20:18:00,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:00,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 20:18:00,899 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 20:18:00,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:00,900 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 20:18:00,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:00,900 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 20:18:00,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:00,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:00,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, 1, 1, 1] [2020-02-10 20:18:00,901 INFO L427 AbstractCegarLoop]: === Iteration 599 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:00,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:00,901 INFO L82 PathProgramCache]: Analyzing trace with hash 80157299, now seen corresponding path program 592 times [2020-02-10 20:18:00,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:00,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485005939] [2020-02-10 20:18:00,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485005939] [2020-02-10 20:18:01,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:01,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38813459] [2020-02-10 20:18:01,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:01,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:01,309 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:18:01,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,428 INFO L93 Difference]: Finished difference Result 1428 states and 4948 transitions. [2020-02-10 20:18:01,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:01,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:01,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,432 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:18:01,432 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:18:01,433 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:18:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 790. [2020-02-10 20:18:01,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:18:01,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3122 transitions. [2020-02-10 20:18:01,456 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3122 transitions. Word has length 25 [2020-02-10 20:18:01,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:01,456 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3122 transitions. [2020-02-10 20:18:01,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:01,457 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3122 transitions. [2020-02-10 20:18:01,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:01,458 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:01,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, 1, 1, 1] [2020-02-10 20:18:01,458 INFO L427 AbstractCegarLoop]: === Iteration 600 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:01,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:01,458 INFO L82 PathProgramCache]: Analyzing trace with hash -436692071, now seen corresponding path program 593 times [2020-02-10 20:18:01,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:01,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313196546] [2020-02-10 20:18:01,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:01,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:01,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313196546] [2020-02-10 20:18:01,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:01,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:01,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754199987] [2020-02-10 20:18:01,850 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:01,850 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:01,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:01,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:01,850 INFO L87 Difference]: Start difference. First operand 790 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:18:01,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:01,984 INFO L93 Difference]: Finished difference Result 1428 states and 4950 transitions. [2020-02-10 20:18:01,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:01,985 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:01,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:01,988 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:18:01,988 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:18:01,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:18:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 796. [2020-02-10 20:18:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:18:02,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3133 transitions. [2020-02-10 20:18:02,012 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3133 transitions. Word has length 25 [2020-02-10 20:18:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,012 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3133 transitions. [2020-02-10 20:18:02,012 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3133 transitions. [2020-02-10 20:18:02,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:02,013 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,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, 1, 1, 1] [2020-02-10 20:18:02,013 INFO L427 AbstractCegarLoop]: === Iteration 601 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1174248887, now seen corresponding path program 594 times [2020-02-10 20:18:02,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826900589] [2020-02-10 20:18:02,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:02,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:02,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826900589] [2020-02-10 20:18:02,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:02,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:02,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612332679] [2020-02-10 20:18:02,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:02,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:02,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:02,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:02,410 INFO L87 Difference]: Start difference. First operand 796 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:18:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:02,547 INFO L93 Difference]: Finished difference Result 1432 states and 4952 transitions. [2020-02-10 20:18:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:02,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:02,551 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:18:02,551 INFO L226 Difference]: Without dead ends: 1404 [2020-02-10 20:18:02,551 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:02,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1404 states. [2020-02-10 20:18:02,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1404 to 786. [2020-02-10 20:18:02,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:18:02,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3111 transitions. [2020-02-10 20:18:02,573 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3111 transitions. Word has length 25 [2020-02-10 20:18:02,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:02,573 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3111 transitions. [2020-02-10 20:18:02,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:02,573 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3111 transitions. [2020-02-10 20:18:02,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:02,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:02,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, 1, 1, 1] [2020-02-10 20:18:02,574 INFO L427 AbstractCegarLoop]: === Iteration 602 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:02,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:02,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1215690539, now seen corresponding path program 595 times [2020-02-10 20:18:02,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:02,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479932193] [2020-02-10 20:18:02,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:02,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:02,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479932193] [2020-02-10 20:18:02,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:02,983 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:02,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775517286] [2020-02-10 20:18:02,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:02,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:02,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:02,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:02,984 INFO L87 Difference]: Start difference. First operand 786 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:18:03,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:03,111 INFO L93 Difference]: Finished difference Result 1441 states and 4989 transitions. [2020-02-10 20:18:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:03,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:03,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:03,115 INFO L225 Difference]: With dead ends: 1441 [2020-02-10 20:18:03,115 INFO L226 Difference]: Without dead ends: 1425 [2020-02-10 20:18:03,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:03,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1425 states. [2020-02-10 20:18:03,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1425 to 798. [2020-02-10 20:18:03,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 20:18:03,137 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 20:18:03,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:03,137 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 20:18:03,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 20:18:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:03,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:03,139 INFO L427 AbstractCegarLoop]: === Iteration 603 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:03,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:03,139 INFO L82 PathProgramCache]: Analyzing trace with hash 395250419, now seen corresponding path program 596 times [2020-02-10 20:18:03,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:03,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376509151] [2020-02-10 20:18:03,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:03,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:03,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:03,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376509151] [2020-02-10 20:18:03,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:03,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:03,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990382489] [2020-02-10 20:18:03,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:03,545 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:03,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:03,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:03,545 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:18:03,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:03,693 INFO L93 Difference]: Finished difference Result 1439 states and 4980 transitions. [2020-02-10 20:18:03,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:03,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:03,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:03,696 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:18:03,697 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:18:03,697 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:03,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:18:03,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 793. [2020-02-10 20:18:03,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:03,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 20:18:03,719 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 20:18:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:03,719 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 20:18:03,719 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 20:18:03,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:03,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:03,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, 1, 1, 1] [2020-02-10 20:18:03,721 INFO L427 AbstractCegarLoop]: === Iteration 604 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:03,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:03,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1478838903, now seen corresponding path program 597 times [2020-02-10 20:18:03,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:03,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383860140] [2020-02-10 20:18:03,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383860140] [2020-02-10 20:18:04,120 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,120 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:04,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671227720] [2020-02-10 20:18:04,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:04,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:04,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:04,121 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:18:04,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,260 INFO L93 Difference]: Finished difference Result 1449 states and 5000 transitions. [2020-02-10 20:18:04,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:04,261 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:04,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,264 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:18:04,264 INFO L226 Difference]: Without dead ends: 1433 [2020-02-10 20:18:04,264 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2020-02-10 20:18:04,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 802. [2020-02-10 20:18:04,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:18:04,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3146 transitions. [2020-02-10 20:18:04,287 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3146 transitions. Word has length 25 [2020-02-10 20:18:04,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,287 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3146 transitions. [2020-02-10 20:18:04,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:04,287 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3146 transitions. [2020-02-10 20:18:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:04,288 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,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, 1, 1, 1] [2020-02-10 20:18:04,288 INFO L427 AbstractCegarLoop]: === Iteration 605 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash 405753523, now seen corresponding path program 598 times [2020-02-10 20:18:04,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667741907] [2020-02-10 20:18:04,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:04,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:04,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667741907] [2020-02-10 20:18:04,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:04,715 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:04,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416273934] [2020-02-10 20:18:04,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:04,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:04,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:04,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:04,716 INFO L87 Difference]: Start difference. First operand 802 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:18:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:04,825 INFO L93 Difference]: Finished difference Result 1451 states and 4996 transitions. [2020-02-10 20:18:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:04,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:04,829 INFO L225 Difference]: With dead ends: 1451 [2020-02-10 20:18:04,829 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:18:04,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:04,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:18:04,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 793. [2020-02-10 20:18:04,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:04,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3123 transitions. [2020-02-10 20:18:04,851 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3123 transitions. Word has length 25 [2020-02-10 20:18:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:04,851 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3123 transitions. [2020-02-10 20:18:04,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3123 transitions. [2020-02-10 20:18:04,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:04,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:04,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, 1, 1, 1] [2020-02-10 20:18:04,853 INFO L427 AbstractCegarLoop]: === Iteration 606 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:04,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:04,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1489342007, now seen corresponding path program 599 times [2020-02-10 20:18:04,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:04,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480129007] [2020-02-10 20:18:04,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:04,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480129007] [2020-02-10 20:18:05,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:05,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754255471] [2020-02-10 20:18:05,257 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:05,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:05,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:05,257 INFO L87 Difference]: Start difference. First operand 793 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:18:05,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,419 INFO L93 Difference]: Finished difference Result 1442 states and 4978 transitions. [2020-02-10 20:18:05,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:05,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:05,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,424 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:18:05,424 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:18:05,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:05,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:18:05,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 799. [2020-02-10 20:18:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:18:05,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3134 transitions. [2020-02-10 20:18:05,447 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3134 transitions. Word has length 25 [2020-02-10 20:18:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:05,447 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3134 transitions. [2020-02-10 20:18:05,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:05,447 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3134 transitions. [2020-02-10 20:18:05,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:05,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:05,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, 1, 1, 1] [2020-02-10 20:18:05,448 INFO L427 AbstractCegarLoop]: === Iteration 607 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:05,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:05,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1194684331, now seen corresponding path program 600 times [2020-02-10 20:18:05,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:05,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122310371] [2020-02-10 20:18:05,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:05,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122310371] [2020-02-10 20:18:05,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:05,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:05,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067553316] [2020-02-10 20:18:05,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:05,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:05,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:05,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:05,866 INFO L87 Difference]: Start difference. First operand 799 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:18:05,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:05,993 INFO L93 Difference]: Finished difference Result 1446 states and 4980 transitions. [2020-02-10 20:18:05,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:05,994 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:05,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:05,997 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:18:05,998 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:18:05,998 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:06,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:18:06,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 776. [2020-02-10 20:18:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:18:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3088 transitions. [2020-02-10 20:18:06,020 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3088 transitions. Word has length 25 [2020-02-10 20:18:06,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,020 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3088 transitions. [2020-02-10 20:18:06,020 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3088 transitions. [2020-02-10 20:18:06,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:06,021 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,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, 1, 1, 1] [2020-02-10 20:18:06,022 INFO L427 AbstractCegarLoop]: === Iteration 608 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2008365005, now seen corresponding path program 601 times [2020-02-10 20:18:06,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441105094] [2020-02-10 20:18:06,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:06,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:06,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441105094] [2020-02-10 20:18:06,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:06,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:06,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721837363] [2020-02-10 20:18:06,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:06,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:06,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:06,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:06,408 INFO L87 Difference]: Start difference. First operand 776 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:18:06,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:06,546 INFO L93 Difference]: Finished difference Result 1421 states and 4973 transitions. [2020-02-10 20:18:06,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:06,547 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:06,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:06,550 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:18:06,550 INFO L226 Difference]: Without dead ends: 1406 [2020-02-10 20:18:06,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1406 states. [2020-02-10 20:18:06,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1406 to 792. [2020-02-10 20:18:06,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:06,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3149 transitions. [2020-02-10 20:18:06,573 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3149 transitions. Word has length 25 [2020-02-10 20:18:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:06,573 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3149 transitions. [2020-02-10 20:18:06,573 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:06,573 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3149 transitions. [2020-02-10 20:18:06,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:06,574 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:06,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, 1, 1, 1] [2020-02-10 20:18:06,574 INFO L427 AbstractCegarLoop]: === Iteration 609 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:06,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:06,574 INFO L82 PathProgramCache]: Analyzing trace with hash -397424047, now seen corresponding path program 602 times [2020-02-10 20:18:06,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:06,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840771548] [2020-02-10 20:18:06,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:06,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:06,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:06,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840771548] [2020-02-10 20:18:06,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:06,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:06,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846172048] [2020-02-10 20:18:06,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:06,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:06,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:06,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:06,976 INFO L87 Difference]: Start difference. First operand 792 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:18:07,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:07,107 INFO L93 Difference]: Finished difference Result 1418 states and 4964 transitions. [2020-02-10 20:18:07,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:07,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:07,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:07,111 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:18:07,111 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:18:07,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:07,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:18:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 789. [2020-02-10 20:18:07,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:07,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3141 transitions. [2020-02-10 20:18:07,133 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3141 transitions. Word has length 25 [2020-02-10 20:18:07,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:07,133 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3141 transitions. [2020-02-10 20:18:07,133 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:07,134 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3141 transitions. [2020-02-10 20:18:07,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:07,134 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:07,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, 1, 1, 1] [2020-02-10 20:18:07,135 INFO L427 AbstractCegarLoop]: === Iteration 610 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:07,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:07,135 INFO L82 PathProgramCache]: Analyzing trace with hash 686164437, now seen corresponding path program 603 times [2020-02-10 20:18:07,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:07,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970685164] [2020-02-10 20:18:07,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:07,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970685164] [2020-02-10 20:18:07,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:07,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:07,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304713886] [2020-02-10 20:18:07,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:07,521 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:07,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:07,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:07,521 INFO L87 Difference]: Start difference. First operand 789 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:18:07,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:07,663 INFO L93 Difference]: Finished difference Result 1428 states and 4987 transitions. [2020-02-10 20:18:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:07,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:07,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:07,668 INFO L225 Difference]: With dead ends: 1428 [2020-02-10 20:18:07,668 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:18:07,668 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:18:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 795. [2020-02-10 20:18:07,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:07,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3152 transitions. [2020-02-10 20:18:07,690 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3152 transitions. Word has length 25 [2020-02-10 20:18:07,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:07,691 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3152 transitions. [2020-02-10 20:18:07,691 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:07,691 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3152 transitions. [2020-02-10 20:18:07,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:07,692 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:07,692 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:07,692 INFO L427 AbstractCegarLoop]: === Iteration 611 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:07,692 INFO L82 PathProgramCache]: Analyzing trace with hash -386920943, now seen corresponding path program 604 times [2020-02-10 20:18:07,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:07,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959679512] [2020-02-10 20:18:07,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959679512] [2020-02-10 20:18:08,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:08,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254182143] [2020-02-10 20:18:08,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:08,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:08,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:08,087 INFO L87 Difference]: Start difference. First operand 795 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:18:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,230 INFO L93 Difference]: Finished difference Result 1429 states and 4983 transitions. [2020-02-10 20:18:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:08,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,234 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:18:08,234 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:18:08,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:08,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:18:08,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 789. [2020-02-10 20:18:08,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:08,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 20:18:08,257 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:08,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,257 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 20:18:08,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:08,258 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 20:18:08,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:08,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,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, 1, 1, 1] [2020-02-10 20:18:08,259 INFO L427 AbstractCegarLoop]: === Iteration 612 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,259 INFO L82 PathProgramCache]: Analyzing trace with hash 696667541, now seen corresponding path program 605 times [2020-02-10 20:18:08,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444960854] [2020-02-10 20:18:08,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:08,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:08,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444960854] [2020-02-10 20:18:08,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:08,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:08,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931851419] [2020-02-10 20:18:08,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:08,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:08,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:08,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:08,647 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:08,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:08,775 INFO L93 Difference]: Finished difference Result 1419 states and 4963 transitions. [2020-02-10 20:18:08,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:08,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:08,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:08,779 INFO L225 Difference]: With dead ends: 1419 [2020-02-10 20:18:08,779 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:18:08,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:08,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:18:08,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 792. [2020-02-10 20:18:08,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:08,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3143 transitions. [2020-02-10 20:18:08,801 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3143 transitions. Word has length 25 [2020-02-10 20:18:08,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:08,801 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3143 transitions. [2020-02-10 20:18:08,801 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3143 transitions. [2020-02-10 20:18:08,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:08,802 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:08,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, 1, 1, 1] [2020-02-10 20:18:08,803 INFO L427 AbstractCegarLoop]: === Iteration 613 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:08,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:08,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1987358797, now seen corresponding path program 606 times [2020-02-10 20:18:08,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:08,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890740133] [2020-02-10 20:18:08,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:08,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:09,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 20:18:09,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890740133] [2020-02-10 20:18:09,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:09,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:09,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273369570] [2020-02-10 20:18:09,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:09,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:09,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:09,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:09,192 INFO L87 Difference]: Start difference. First operand 792 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:18:09,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,342 INFO L93 Difference]: Finished difference Result 1423 states and 4968 transitions. [2020-02-10 20:18:09,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:09,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:09,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,346 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:18:09,346 INFO L226 Difference]: Without dead ends: 1401 [2020-02-10 20:18:09,346 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:09,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1401 states. [2020-02-10 20:18:09,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1401 to 786. [2020-02-10 20:18:09,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:18:09,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3130 transitions. [2020-02-10 20:18:09,368 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3130 transitions. Word has length 25 [2020-02-10 20:18:09,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,369 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3130 transitions. [2020-02-10 20:18:09,369 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:09,369 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3130 transitions. [2020-02-10 20:18:09,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:09,370 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,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, 1, 1, 1] [2020-02-10 20:18:09,370 INFO L427 AbstractCegarLoop]: === Iteration 614 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,370 INFO L82 PathProgramCache]: Analyzing trace with hash -82330927, now seen corresponding path program 607 times [2020-02-10 20:18:09,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618090174] [2020-02-10 20:18:09,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:09,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 20:18:09,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618090174] [2020-02-10 20:18:09,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:09,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:09,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061954964] [2020-02-10 20:18:09,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:09,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:09,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:09,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:09,765 INFO L87 Difference]: Start difference. First operand 786 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:18:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:09,919 INFO L93 Difference]: Finished difference Result 1418 states and 4963 transitions. [2020-02-10 20:18:09,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:09,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:09,923 INFO L225 Difference]: With dead ends: 1418 [2020-02-10 20:18:09,923 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:18:09,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:18:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 20:18:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:09,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3146 transitions. [2020-02-10 20:18:09,946 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3146 transitions. Word has length 25 [2020-02-10 20:18:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:09,946 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3146 transitions. [2020-02-10 20:18:09,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:09,946 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3146 transitions. [2020-02-10 20:18:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:09,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:09,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, 1, 1, 1] [2020-02-10 20:18:09,947 INFO L427 AbstractCegarLoop]: === Iteration 615 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:09,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:09,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1528610031, now seen corresponding path program 608 times [2020-02-10 20:18:09,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:09,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520907361] [2020-02-10 20:18:09,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:09,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520907361] [2020-02-10 20:18:10,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:10,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529365652] [2020-02-10 20:18:10,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:10,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:10,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:10,345 INFO L87 Difference]: Start difference. First operand 792 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:18:10,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:10,506 INFO L93 Difference]: Finished difference Result 1415 states and 4954 transitions. [2020-02-10 20:18:10,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:10,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:10,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:10,510 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:18:10,511 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:18:10,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:10,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:18:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 20:18:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:10,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3138 transitions. [2020-02-10 20:18:10,533 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:10,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:10,533 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3138 transitions. [2020-02-10 20:18:10,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:10,533 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3138 transitions. [2020-02-10 20:18:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:10,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:10,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:10,534 INFO L427 AbstractCegarLoop]: === Iteration 616 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:10,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:10,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1011760661, now seen corresponding path program 609 times [2020-02-10 20:18:10,535 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:10,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580883286] [2020-02-10 20:18:10,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:10,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:10,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:10,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580883286] [2020-02-10 20:18:10,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:10,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:10,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811817784] [2020-02-10 20:18:10,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:10,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:10,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:10,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:10,954 INFO L87 Difference]: Start difference. First operand 789 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:11,118 INFO L93 Difference]: Finished difference Result 1422 states and 4970 transitions. [2020-02-10 20:18:11,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:11,119 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:11,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:11,122 INFO L225 Difference]: With dead ends: 1422 [2020-02-10 20:18:11,122 INFO L226 Difference]: Without dead ends: 1407 [2020-02-10 20:18:11,122 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:11,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2020-02-10 20:18:11,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 794. [2020-02-10 20:18:11,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3147 transitions. [2020-02-10 20:18:11,145 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3147 transitions. Word has length 25 [2020-02-10 20:18:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:11,145 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3147 transitions. [2020-02-10 20:18:11,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3147 transitions. [2020-02-10 20:18:11,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:11,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:11,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, 1, 1, 1] [2020-02-10 20:18:11,146 INFO L427 AbstractCegarLoop]: === Iteration 617 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:11,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:11,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1549616239, now seen corresponding path program 610 times [2020-02-10 20:18:11,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:11,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880114273] [2020-02-10 20:18:11,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:11,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 20:18:11,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880114273] [2020-02-10 20:18:11,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:11,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:11,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836275911] [2020-02-10 20:18:11,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:11,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:11,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:11,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:11,550 INFO L87 Difference]: Start difference. First operand 794 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:18:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:11,701 INFO L93 Difference]: Finished difference Result 1421 states and 4963 transitions. [2020-02-10 20:18:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:11,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:11,705 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:18:11,705 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:18:11,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:11,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:18:11,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 20:18:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3135 transitions. [2020-02-10 20:18:11,727 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3135 transitions. Word has length 25 [2020-02-10 20:18:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:11,728 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3135 transitions. [2020-02-10 20:18:11,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:11,728 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3135 transitions. [2020-02-10 20:18:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:11,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:11,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, 1, 1, 1] [2020-02-10 20:18:11,729 INFO L427 AbstractCegarLoop]: === Iteration 618 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:11,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:11,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1022263765, now seen corresponding path program 611 times [2020-02-10 20:18:11,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:11,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953155512] [2020-02-10 20:18:11,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953155512] [2020-02-10 20:18:12,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:12,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754632928] [2020-02-10 20:18:12,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:12,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:12,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:12,118 INFO L87 Difference]: Start difference. First operand 789 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:18:12,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,269 INFO L93 Difference]: Finished difference Result 1414 states and 4949 transitions. [2020-02-10 20:18:12,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:12,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:12,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,273 INFO L225 Difference]: With dead ends: 1414 [2020-02-10 20:18:12,273 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:18:12,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:12,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:18:12,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 792. [2020-02-10 20:18:12,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:12,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 20:18:12,295 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 20:18:12,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,296 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 20:18:12,296 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:12,296 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 20:18:12,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:12,297 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,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, 1, 1, 1] [2020-02-10 20:18:12,297 INFO L427 AbstractCegarLoop]: === Iteration 619 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash -50821615, now seen corresponding path program 612 times [2020-02-10 20:18:12,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444477633] [2020-02-10 20:18:12,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:12,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:12,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444477633] [2020-02-10 20:18:12,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:12,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:12,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114509379] [2020-02-10 20:18:12,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:12,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:12,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:12,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:12,691 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:18:12,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:12,854 INFO L93 Difference]: Finished difference Result 1416 states and 4950 transitions. [2020-02-10 20:18:12,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:12,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:12,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:12,858 INFO L225 Difference]: With dead ends: 1416 [2020-02-10 20:18:12,858 INFO L226 Difference]: Without dead ends: 1396 [2020-02-10 20:18:12,858 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:12,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2020-02-10 20:18:12,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 786. [2020-02-10 20:18:12,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:18:12,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3127 transitions. [2020-02-10 20:18:12,881 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3127 transitions. Word has length 25 [2020-02-10 20:18:12,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:12,881 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3127 transitions. [2020-02-10 20:18:12,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:12,881 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3127 transitions. [2020-02-10 20:18:12,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:12,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:12,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, 1, 1, 1] [2020-02-10 20:18:12,882 INFO L427 AbstractCegarLoop]: === Iteration 620 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:12,883 INFO L82 PathProgramCache]: Analyzing trace with hash 243265297, now seen corresponding path program 613 times [2020-02-10 20:18:12,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:12,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086163000] [2020-02-10 20:18:12,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:12,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:13,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086163000] [2020-02-10 20:18:13,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:13,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874005671] [2020-02-10 20:18:13,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:13,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:13,280 INFO L87 Difference]: Start difference. First operand 786 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:18:13,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:13,415 INFO L93 Difference]: Finished difference Result 1436 states and 5008 transitions. [2020-02-10 20:18:13,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:13,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:13,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:13,419 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:18:13,419 INFO L226 Difference]: Without dead ends: 1421 [2020-02-10 20:18:13,420 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:13,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1421 states. [2020-02-10 20:18:13,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1421 to 797. [2020-02-10 20:18:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:13,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3157 transitions. [2020-02-10 20:18:13,442 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3157 transitions. Word has length 25 [2020-02-10 20:18:13,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:13,442 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3157 transitions. [2020-02-10 20:18:13,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:13,442 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3157 transitions. [2020-02-10 20:18:13,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:13,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:13,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, 1, 1, 1] [2020-02-10 20:18:13,443 INFO L427 AbstractCegarLoop]: === Iteration 621 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:13,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:13,444 INFO L82 PathProgramCache]: Analyzing trace with hash -829820083, now seen corresponding path program 614 times [2020-02-10 20:18:13,444 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:13,444 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901815065] [2020-02-10 20:18:13,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:13,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 20:18:13,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901815065] [2020-02-10 20:18:13,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:13,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:13,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185383169] [2020-02-10 20:18:13,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:13,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:13,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:13,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:13,860 INFO L87 Difference]: Start difference. First operand 797 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:18:14,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,014 INFO L93 Difference]: Finished difference Result 1437 states and 5004 transitions. [2020-02-10 20:18:14,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:14,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:14,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,018 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:18:14,018 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:18:14,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:14,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:18:14,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 20:18:14,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:14,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3141 transitions. [2020-02-10 20:18:14,040 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3141 transitions. Word has length 25 [2020-02-10 20:18:14,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,040 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3141 transitions. [2020-02-10 20:18:14,041 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:14,041 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3141 transitions. [2020-02-10 20:18:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:14,042 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,042 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:14,042 INFO L427 AbstractCegarLoop]: === Iteration 622 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1357172557, now seen corresponding path program 615 times [2020-02-10 20:18:14,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,042 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235246033] [2020-02-10 20:18:14,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:14,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:14,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235246033] [2020-02-10 20:18:14,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:14,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:14,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883102850] [2020-02-10 20:18:14,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:14,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:14,449 INFO L87 Difference]: Start difference. First operand 791 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:18:14,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:14,617 INFO L93 Difference]: Finished difference Result 1433 states and 4996 transitions. [2020-02-10 20:18:14,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:14,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:14,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:14,622 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:18:14,622 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:18:14,622 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:14,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:18:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 796. [2020-02-10 20:18:14,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:18:14,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3150 transitions. [2020-02-10 20:18:14,645 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3150 transitions. Word has length 25 [2020-02-10 20:18:14,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:14,645 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3150 transitions. [2020-02-10 20:18:14,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:14,645 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3150 transitions. [2020-02-10 20:18:14,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:14,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:14,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, 1, 1, 1] [2020-02-10 20:18:14,647 INFO L427 AbstractCegarLoop]: === Iteration 623 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:14,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:14,647 INFO L82 PathProgramCache]: Analyzing trace with hash -819316979, now seen corresponding path program 616 times [2020-02-10 20:18:14,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:14,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179777007] [2020-02-10 20:18:14,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:14,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18: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 20:18:15,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179777007] [2020-02-10 20:18:15,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:15,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921469593] [2020-02-10 20:18:15,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:15,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:15,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:15,051 INFO L87 Difference]: Start difference. First operand 796 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:18:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,205 INFO L93 Difference]: Finished difference Result 1432 states and 4989 transitions. [2020-02-10 20:18:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:15,206 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:15,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,210 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:18:15,210 INFO L226 Difference]: Without dead ends: 1413 [2020-02-10 20:18:15,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2020-02-10 20:18:15,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 791. [2020-02-10 20:18:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:15,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 20:18:15,232 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 20:18:15,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,232 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 20:18:15,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:15,233 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 20:18:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:15,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:15,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, 1, 1, 1] [2020-02-10 20:18:15,234 INFO L427 AbstractCegarLoop]: === Iteration 624 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1336166349, now seen corresponding path program 617 times [2020-02-10 20:18:15,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642207447] [2020-02-10 20:18:15,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:15,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:15,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642207447] [2020-02-10 20:18:15,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:15,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:15,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826023752] [2020-02-10 20:18:15,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:15,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:15,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:15,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:15,630 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:18:15,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:15,792 INFO L93 Difference]: Finished difference Result 1435 states and 4995 transitions. [2020-02-10 20:18:15,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:15,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:15,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:15,795 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:18:15,796 INFO L226 Difference]: Without dead ends: 1419 [2020-02-10 20:18:15,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:15,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1419 states. [2020-02-10 20:18:15,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1419 to 796. [2020-02-10 20:18:15,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:18:15,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3145 transitions. [2020-02-10 20:18:15,818 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3145 transitions. Word has length 25 [2020-02-10 20:18:15,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:15,818 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3145 transitions. [2020-02-10 20:18:15,818 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:15,818 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3145 transitions. [2020-02-10 20:18:15,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:15,819 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:15,819 INFO L427 AbstractCegarLoop]: === Iteration 625 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:15,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:15,819 INFO L82 PathProgramCache]: Analyzing trace with hash 274774609, now seen corresponding path program 618 times [2020-02-10 20:18:15,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:15,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562484911] [2020-02-10 20:18:15,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:16,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562484911] [2020-02-10 20:18:16,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:16,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269099535] [2020-02-10 20:18:16,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:16,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:16,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:16,212 INFO L87 Difference]: Start difference. First operand 796 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:18:16,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:16,363 INFO L93 Difference]: Finished difference Result 1433 states and 4986 transitions. [2020-02-10 20:18:16,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:16,364 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:16,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:16,368 INFO L225 Difference]: With dead ends: 1433 [2020-02-10 20:18:16,368 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:18:16,368 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:16,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:18:16,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 786. [2020-02-10 20:18:16,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:18:16,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3124 transitions. [2020-02-10 20:18:16,390 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3124 transitions. Word has length 25 [2020-02-10 20:18:16,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:16,390 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3124 transitions. [2020-02-10 20:18:16,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:16,391 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3124 transitions. [2020-02-10 20:18:16,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:16,403 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:16,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, 1, 1, 1] [2020-02-10 20:18:16,403 INFO L427 AbstractCegarLoop]: === Iteration 626 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:16,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:16,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2115164817, now seen corresponding path program 619 times [2020-02-10 20:18:16,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:16,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729797981] [2020-02-10 20:18:16,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:16,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:16,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 20:18:16,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729797981] [2020-02-10 20:18:16,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:16,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:16,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683496704] [2020-02-10 20:18:16,780 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:16,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:16,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:16,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:16,781 INFO L87 Difference]: Start difference. First operand 786 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:18:16,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:16,916 INFO L93 Difference]: Finished difference Result 1417 states and 4955 transitions. [2020-02-10 20:18:16,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:16,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:16,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:16,920 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:18:16,920 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:18:16,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:16,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:18:16,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 792. [2020-02-10 20:18:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3140 transitions. [2020-02-10 20:18:16,943 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3140 transitions. Word has length 25 [2020-02-10 20:18:16,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:16,943 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3140 transitions. [2020-02-10 20:18:16,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:16,943 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3140 transitions. [2020-02-10 20:18:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:16,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:16,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, 1, 1, 1] [2020-02-10 20:18:16,945 INFO L427 AbstractCegarLoop]: === Iteration 627 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:16,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash -504223859, now seen corresponding path program 620 times [2020-02-10 20:18:16,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:16,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60981464] [2020-02-10 20:18:16,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:16,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,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 20:18:17,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60981464] [2020-02-10 20:18:17,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:17,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135716676] [2020-02-10 20:18:17,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:17,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:17,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:17,324 INFO L87 Difference]: Start difference. First operand 792 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:18:17,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:17,482 INFO L93 Difference]: Finished difference Result 1421 states and 4960 transitions. [2020-02-10 20:18:17,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:17,482 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:17,486 INFO L225 Difference]: With dead ends: 1421 [2020-02-10 20:18:17,486 INFO L226 Difference]: Without dead ends: 1402 [2020-02-10 20:18:17,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1402 states. [2020-02-10 20:18:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1402 to 789. [2020-02-10 20:18:17,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:17,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 20:18:17,509 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 20:18:17,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:17,509 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 20:18:17,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:17,509 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 20:18:17,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:17,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:17,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, 1, 1, 1] [2020-02-10 20:18:17,510 INFO L427 AbstractCegarLoop]: === Iteration 628 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:17,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:17,510 INFO L82 PathProgramCache]: Analyzing trace with hash 579364625, now seen corresponding path program 621 times [2020-02-10 20:18:17,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:17,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16107720] [2020-02-10 20:18:17,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:17,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:17,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 20:18:17,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16107720] [2020-02-10 20:18:17,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:17,895 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:17,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388609197] [2020-02-10 20:18:17,895 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:17,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:17,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:17,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:17,895 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:18:18,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:18,050 INFO L93 Difference]: Finished difference Result 1415 states and 4948 transitions. [2020-02-10 20:18:18,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:18,050 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:18,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:18,054 INFO L225 Difference]: With dead ends: 1415 [2020-02-10 20:18:18,054 INFO L226 Difference]: Without dead ends: 1403 [2020-02-10 20:18:18,054 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:18,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1403 states. [2020-02-10 20:18:18,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1403 to 792. [2020-02-10 20:18:18,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:18,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3137 transitions. [2020-02-10 20:18:18,076 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3137 transitions. Word has length 25 [2020-02-10 20:18:18,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:18,076 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3137 transitions. [2020-02-10 20:18:18,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:18,077 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3137 transitions. [2020-02-10 20:18:18,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:18,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:18,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, 1, 1, 1] [2020-02-10 20:18:18,078 INFO L427 AbstractCegarLoop]: === Iteration 629 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:18,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:18,078 INFO L82 PathProgramCache]: Analyzing trace with hash -493720755, now seen corresponding path program 622 times [2020-02-10 20:18:18,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:18,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990652218] [2020-02-10 20:18:18,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:18,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:18,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990652218] [2020-02-10 20:18:18,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:18,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:18,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594990078] [2020-02-10 20:18:18,464 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:18,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:18,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:18,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:18,465 INFO L87 Difference]: Start difference. First operand 792 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:18:18,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:18,612 INFO L93 Difference]: Finished difference Result 1417 states and 4949 transitions. [2020-02-10 20:18:18,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:18,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:18,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:18,616 INFO L225 Difference]: With dead ends: 1417 [2020-02-10 20:18:18,616 INFO L226 Difference]: Without dead ends: 1400 [2020-02-10 20:18:18,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1400 states. [2020-02-10 20:18:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1400 to 789. [2020-02-10 20:18:18,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3129 transitions. [2020-02-10 20:18:18,639 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3129 transitions. Word has length 25 [2020-02-10 20:18:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:18,639 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3129 transitions. [2020-02-10 20:18:18,639 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3129 transitions. [2020-02-10 20:18:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:18,640 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:18,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, 1, 1, 1] [2020-02-10 20:18:18,640 INFO L427 AbstractCegarLoop]: === Iteration 630 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:18,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:18,640 INFO L82 PathProgramCache]: Analyzing trace with hash 589867729, now seen corresponding path program 623 times [2020-02-10 20:18:18,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:18,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674289438] [2020-02-10 20:18:18,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:18,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:19,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674289438] [2020-02-10 20:18:19,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:19,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806992492] [2020-02-10 20:18:19,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:19,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:19,024 INFO L87 Difference]: Start difference. First operand 789 states and 3129 transitions. Second operand 10 states. [2020-02-10 20:18:19,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,176 INFO L93 Difference]: Finished difference Result 1425 states and 4967 transitions. [2020-02-10 20:18:19,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:19,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:19,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,180 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:18:19,180 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:18:19,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:19,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:18:19,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 794. [2020-02-10 20:18:19,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3138 transitions. [2020-02-10 20:18:19,203 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,203 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3138 transitions. [2020-02-10 20:18:19,203 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3138 transitions. [2020-02-10 20:18:19,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:19,204 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:19,204 INFO L427 AbstractCegarLoop]: === Iteration 631 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash -2094158609, now seen corresponding path program 624 times [2020-02-10 20:18:19,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188582343] [2020-02-10 20:18:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:19,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 20:18:19,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188582343] [2020-02-10 20:18:19,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:19,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:19,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201820771] [2020-02-10 20:18:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:19,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:19,579 INFO L87 Difference]: Start difference. First operand 794 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:19,726 INFO L93 Difference]: Finished difference Result 1423 states and 4958 transitions. [2020-02-10 20:18:19,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:19,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:19,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:19,730 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:18:19,730 INFO L226 Difference]: Without dead ends: 1398 [2020-02-10 20:18:19,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:19,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2020-02-10 20:18:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 783. [2020-02-10 20:18:19,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:18:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:18:19,753 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:18:19,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:19,753 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:18:19,753 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:19,753 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:18:19,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:19,754 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:19,754 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:19,754 INFO L427 AbstractCegarLoop]: === Iteration 632 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:19,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:19,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1864116565, now seen corresponding path program 625 times [2020-02-10 20:18:19,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:19,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542587336] [2020-02-10 20:18:19,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:19,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:20,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542587336] [2020-02-10 20:18:20,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:20,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831006150] [2020-02-10 20:18:20,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:20,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:20,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:20,153 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:18:20,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:20,320 INFO L93 Difference]: Finished difference Result 1442 states and 5020 transitions. [2020-02-10 20:18:20,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:20,320 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:20,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:20,324 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:18:20,324 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:18:20,324 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:20,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:18:20,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 795. [2020-02-10 20:18:20,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:20,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3155 transitions. [2020-02-10 20:18:20,347 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3155 transitions. Word has length 25 [2020-02-10 20:18:20,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:20,347 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3155 transitions. [2020-02-10 20:18:20,347 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:20,347 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3155 transitions. [2020-02-10 20:18:20,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:20,348 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:20,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, 1, 1, 1] [2020-02-10 20:18:20,349 INFO L427 AbstractCegarLoop]: === Iteration 633 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:20,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash -819909773, now seen corresponding path program 626 times [2020-02-10 20:18:20,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:20,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646078826] [2020-02-10 20:18:20,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:20,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:20,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 20:18:20,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646078826] [2020-02-10 20:18:20,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:20,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:20,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16190486] [2020-02-10 20:18:20,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:20,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:20,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:20,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:20,740 INFO L87 Difference]: Start difference. First operand 795 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:18:20,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:20,903 INFO L93 Difference]: Finished difference Result 1439 states and 5011 transitions. [2020-02-10 20:18:20,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:20,903 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:20,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:20,907 INFO L225 Difference]: With dead ends: 1439 [2020-02-10 20:18:20,907 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:18:20,907 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:20,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:18:20,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 20:18:20,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3147 transitions. [2020-02-10 20:18:20,929 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3147 transitions. Word has length 25 [2020-02-10 20:18:20,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:20,929 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3147 transitions. [2020-02-10 20:18:20,929 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3147 transitions. [2020-02-10 20:18:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:20,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:20,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, 1, 1, 1] [2020-02-10 20:18:20,931 INFO L427 AbstractCegarLoop]: === Iteration 634 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:20,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:20,931 INFO L82 PathProgramCache]: Analyzing trace with hash 263678711, now seen corresponding path program 627 times [2020-02-10 20:18:20,931 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:20,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485652597] [2020-02-10 20:18:20,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485652597] [2020-02-10 20:18:21,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:21,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299284971] [2020-02-10 20:18:21,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:21,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:21,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:21,337 INFO L87 Difference]: Start difference. First operand 792 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:18:21,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:21,484 INFO L93 Difference]: Finished difference Result 1449 states and 5034 transitions. [2020-02-10 20:18:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:21,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:21,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:21,487 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:18:21,488 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:18:21,488 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:18:21,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 798. [2020-02-10 20:18:21,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3158 transitions. [2020-02-10 20:18:21,510 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3158 transitions. Word has length 25 [2020-02-10 20:18:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:21,510 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3158 transitions. [2020-02-10 20:18:21,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3158 transitions. [2020-02-10 20:18:21,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:21,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:21,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, 1, 1, 1] [2020-02-10 20:18:21,511 INFO L427 AbstractCegarLoop]: === Iteration 635 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash -809406669, now seen corresponding path program 628 times [2020-02-10 20:18:21,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:21,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109368479] [2020-02-10 20:18:21,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:21,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109368479] [2020-02-10 20:18:21,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:21,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:21,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612449754] [2020-02-10 20:18:21,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:21,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:21,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:21,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:21,927 INFO L87 Difference]: Start difference. First operand 798 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:18:22,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,092 INFO L93 Difference]: Finished difference Result 1450 states and 5030 transitions. [2020-02-10 20:18:22,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:22,092 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:22,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,096 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:18:22,096 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:18:22,096 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:22,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:18:22,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 792. [2020-02-10 20:18:22,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3144 transitions. [2020-02-10 20:18:22,118 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3144 transitions. Word has length 25 [2020-02-10 20:18:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,119 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3144 transitions. [2020-02-10 20:18:22,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3144 transitions. [2020-02-10 20:18:22,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:22,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,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, 1, 1, 1] [2020-02-10 20:18:22,120 INFO L427 AbstractCegarLoop]: === Iteration 636 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,120 INFO L82 PathProgramCache]: Analyzing trace with hash 274181815, now seen corresponding path program 629 times [2020-02-10 20:18:22,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035656117] [2020-02-10 20:18:22,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:22,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:22,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035656117] [2020-02-10 20:18:22,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:22,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:22,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211341631] [2020-02-10 20:18:22,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:22,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:22,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:22,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:22,518 INFO L87 Difference]: Start difference. First operand 792 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:18:22,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:22,681 INFO L93 Difference]: Finished difference Result 1440 states and 5010 transitions. [2020-02-10 20:18:22,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:22,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:22,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:22,685 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:18:22,685 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:18:22,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:22,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:18:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 795. [2020-02-10 20:18:22,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:22,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3149 transitions. [2020-02-10 20:18:22,708 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3149 transitions. Word has length 25 [2020-02-10 20:18:22,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:22,709 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3149 transitions. [2020-02-10 20:18:22,709 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:22,709 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3149 transitions. [2020-02-10 20:18:22,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:22,710 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:22,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, 1, 1, 1] [2020-02-10 20:18:22,710 INFO L427 AbstractCegarLoop]: === Iteration 637 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:22,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:22,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1885122773, now seen corresponding path program 630 times [2020-02-10 20:18:22,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:22,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132683270] [2020-02-10 20:18:22,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132683270] [2020-02-10 20:18:23,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:23,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451306443] [2020-02-10 20:18:23,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:23,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:23,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:23,110 INFO L87 Difference]: Start difference. First operand 795 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:18:23,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:23,247 INFO L93 Difference]: Finished difference Result 1444 states and 5015 transitions. [2020-02-10 20:18:23,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:23,248 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:23,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:23,251 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:18:23,252 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:18:23,252 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:23,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:18:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 789. [2020-02-10 20:18:23,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:23,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3136 transitions. [2020-02-10 20:18:23,274 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3136 transitions. Word has length 25 [2020-02-10 20:18:23,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:23,275 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3136 transitions. [2020-02-10 20:18:23,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:23,275 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3136 transitions. [2020-02-10 20:18:23,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:23,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:23,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, 1, 1, 1] [2020-02-10 20:18:23,276 INFO L427 AbstractCegarLoop]: === Iteration 638 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:23,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:23,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1421217425, now seen corresponding path program 631 times [2020-02-10 20:18:23,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:23,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573011385] [2020-02-10 20:18:23,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:23,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573011385] [2020-02-10 20:18:23,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:23,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:23,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661517230] [2020-02-10 20:18:23,676 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:23,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:23,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:23,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:23,677 INFO L87 Difference]: Start difference. First operand 789 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:18:23,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:23,842 INFO L93 Difference]: Finished difference Result 1447 states and 5027 transitions. [2020-02-10 20:18:23,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:23,842 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:23,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:23,846 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:18:23,846 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:18:23,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:23,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:18:23,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 796. [2020-02-10 20:18:23,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:18:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3155 transitions. [2020-02-10 20:18:23,869 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3155 transitions. Word has length 25 [2020-02-10 20:18:23,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:23,869 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3155 transitions. [2020-02-10 20:18:23,869 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:23,869 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3155 transitions. [2020-02-10 20:18:23,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:23,870 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:23,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, 1, 1, 1] [2020-02-10 20:18:23,870 INFO L427 AbstractCegarLoop]: === Iteration 639 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:23,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1262808913, now seen corresponding path program 632 times [2020-02-10 20:18:23,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:23,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257684011] [2020-02-10 20:18:23,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:24,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:24,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257684011] [2020-02-10 20:18:24,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:24,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:24,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719416509] [2020-02-10 20:18:24,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:24,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:24,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:24,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:24,291 INFO L87 Difference]: Start difference. First operand 796 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:18:24,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:24,437 INFO L93 Difference]: Finished difference Result 1444 states and 5018 transitions. [2020-02-10 20:18:24,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:24,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:24,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:24,442 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:18:24,442 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:18:24,442 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:18:24,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 793. [2020-02-10 20:18:24,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:24,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3147 transitions. [2020-02-10 20:18:24,466 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3147 transitions. Word has length 25 [2020-02-10 20:18:24,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:24,466 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3147 transitions. [2020-02-10 20:18:24,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:24,466 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3147 transitions. [2020-02-10 20:18:24,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:24,468 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:24,468 INFO L427 AbstractCegarLoop]: === Iteration 640 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:24,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:24,468 INFO L82 PathProgramCache]: Analyzing trace with hash 914871159, now seen corresponding path program 633 times [2020-02-10 20:18:24,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:24,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045153351] [2020-02-10 20:18:24,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:24,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:24,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045153351] [2020-02-10 20:18:24,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:24,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:24,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447941966] [2020-02-10 20:18:24,873 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:24,873 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:24,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:24,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:24,873 INFO L87 Difference]: Start difference. First operand 793 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:18:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:25,035 INFO L93 Difference]: Finished difference Result 1457 states and 5046 transitions. [2020-02-10 20:18:25,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:25,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:25,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:25,039 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:18:25,040 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:18:25,040 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:25,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:18:25,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 800. [2020-02-10 20:18:25,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:18:25,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3160 transitions. [2020-02-10 20:18:25,064 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3160 transitions. Word has length 25 [2020-02-10 20:18:25,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:25,064 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3160 transitions. [2020-02-10 20:18:25,064 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:25,064 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3160 transitions. [2020-02-10 20:18:25,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:25,065 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:25,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, 1, 1, 1] [2020-02-10 20:18:25,065 INFO L427 AbstractCegarLoop]: === Iteration 641 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:25,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:25,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1231299601, now seen corresponding path program 634 times [2020-02-10 20:18:25,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:25,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702197862] [2020-02-10 20:18:25,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:25,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:25,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:25,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702197862] [2020-02-10 20:18:25,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:25,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:25,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415491435] [2020-02-10 20:18:25,473 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:25,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:25,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:25,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:25,474 INFO L87 Difference]: Start difference. First operand 800 states and 3160 transitions. Second operand 10 states. [2020-02-10 20:18:25,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:25,591 INFO L93 Difference]: Finished difference Result 1460 states and 5045 transitions. [2020-02-10 20:18:25,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:25,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:25,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:25,596 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:18:25,596 INFO L226 Difference]: Without dead ends: 1435 [2020-02-10 20:18:25,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:25,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435 states. [2020-02-10 20:18:25,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435 to 793. [2020-02-10 20:18:25,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:25,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3143 transitions. [2020-02-10 20:18:25,619 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3143 transitions. Word has length 25 [2020-02-10 20:18:25,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:25,619 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3143 transitions. [2020-02-10 20:18:25,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:25,619 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3143 transitions. [2020-02-10 20:18:25,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:25,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:25,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, 1, 1, 1] [2020-02-10 20:18:25,621 INFO L427 AbstractCegarLoop]: === Iteration 642 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:25,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:25,621 INFO L82 PathProgramCache]: Analyzing trace with hash 925374263, now seen corresponding path program 635 times [2020-02-10 20:18:25,621 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:25,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258914566] [2020-02-10 20:18:25,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:25,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:26,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:26,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258914566] [2020-02-10 20:18:26,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:26,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:26,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686157924] [2020-02-10 20:18:26,021 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:26,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:26,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:26,022 INFO L87 Difference]: Start difference. First operand 793 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:18:26,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,184 INFO L93 Difference]: Finished difference Result 1448 states and 5021 transitions. [2020-02-10 20:18:26,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:26,185 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:26,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,188 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:18:26,189 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:18:26,189 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:26,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:18:26,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 797. [2020-02-10 20:18:26,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:26,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3150 transitions. [2020-02-10 20:18:26,212 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3150 transitions. Word has length 25 [2020-02-10 20:18:26,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,212 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3150 transitions. [2020-02-10 20:18:26,212 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:26,212 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3150 transitions. [2020-02-10 20:18:26,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:26,213 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,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, 1, 1, 1] [2020-02-10 20:18:26,213 INFO L427 AbstractCegarLoop]: === Iteration 643 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1463229841, now seen corresponding path program 636 times [2020-02-10 20:18:26,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983859520] [2020-02-10 20:18:26,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:26,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:26,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983859520] [2020-02-10 20:18:26,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:26,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:26,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439831] [2020-02-10 20:18:26,640 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:26,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:26,640 INFO L87 Difference]: Start difference. First operand 797 states and 3150 transitions. Second operand 10 states. [2020-02-10 20:18:26,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:26,755 INFO L93 Difference]: Finished difference Result 1454 states and 5029 transitions. [2020-02-10 20:18:26,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:26,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:26,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:26,759 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:18:26,760 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:18:26,760 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:26,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:18:26,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 789. [2020-02-10 20:18:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3132 transitions. [2020-02-10 20:18:26,782 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3132 transitions. Word has length 25 [2020-02-10 20:18:26,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:26,782 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3132 transitions. [2020-02-10 20:18:26,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:26,782 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3132 transitions. [2020-02-10 20:18:26,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:26,783 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:26,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, 1, 1, 1] [2020-02-10 20:18:26,783 INFO L427 AbstractCegarLoop]: === Iteration 644 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:26,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:26,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1746813649, now seen corresponding path program 637 times [2020-02-10 20:18:26,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:26,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388955861] [2020-02-10 20:18:26,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:27,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388955861] [2020-02-10 20:18:27,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:27,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99649123] [2020-02-10 20:18:27,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:27,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:27,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:27,194 INFO L87 Difference]: Start difference. First operand 789 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:18:27,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:27,351 INFO L93 Difference]: Finished difference Result 1471 states and 5085 transitions. [2020-02-10 20:18:27,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:27,351 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:27,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:27,355 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:18:27,355 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:18:27,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:27,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:18:27,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 804. [2020-02-10 20:18:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:18:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3172 transitions. [2020-02-10 20:18:27,378 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3172 transitions. Word has length 25 [2020-02-10 20:18:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:27,379 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3172 transitions. [2020-02-10 20:18:27,379 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3172 transitions. [2020-02-10 20:18:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:27,380 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:27,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, 1, 1, 1] [2020-02-10 20:18:27,380 INFO L427 AbstractCegarLoop]: === Iteration 645 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:27,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash 673728269, now seen corresponding path program 638 times [2020-02-10 20:18:27,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:27,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597150501] [2020-02-10 20:18:27,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:27,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:27,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 20:18:27,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597150501] [2020-02-10 20:18:27,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:27,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:27,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949800007] [2020-02-10 20:18:27,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:27,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:27,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:27,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:27,787 INFO L87 Difference]: Start difference. First operand 804 states and 3172 transitions. Second operand 10 states. [2020-02-10 20:18:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:27,938 INFO L93 Difference]: Finished difference Result 1472 states and 5081 transitions. [2020-02-10 20:18:27,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:27,939 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:27,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:27,942 INFO L225 Difference]: With dead ends: 1472 [2020-02-10 20:18:27,943 INFO L226 Difference]: Without dead ends: 1450 [2020-02-10 20:18:27,943 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:27,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2020-02-10 20:18:27,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 798. [2020-02-10 20:18:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3155 transitions. [2020-02-10 20:18:27,966 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3155 transitions. Word has length 25 [2020-02-10 20:18:27,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:27,966 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3155 transitions. [2020-02-10 20:18:27,966 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:27,966 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3155 transitions. [2020-02-10 20:18:27,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:27,967 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:27,967 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:27,967 INFO L427 AbstractCegarLoop]: === Iteration 646 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:27,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:27,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1454062059, now seen corresponding path program 639 times [2020-02-10 20:18:27,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:27,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842127726] [2020-02-10 20:18:27,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:28,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:28,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842127726] [2020-02-10 20:18:28,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:28,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:28,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875286560] [2020-02-10 20:18:28,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:28,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:28,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:28,375 INFO L87 Difference]: Start difference. First operand 798 states and 3155 transitions. Second operand 10 states. [2020-02-10 20:18:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:28,507 INFO L93 Difference]: Finished difference Result 1474 states and 5084 transitions. [2020-02-10 20:18:28,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:28,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:28,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:28,511 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:18:28,511 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:18:28,512 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:28,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:18:28,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 805. [2020-02-10 20:18:28,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:18:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3168 transitions. [2020-02-10 20:18:28,535 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3168 transitions. Word has length 25 [2020-02-10 20:18:28,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:28,535 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3168 transitions. [2020-02-10 20:18:28,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:28,535 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3168 transitions. [2020-02-10 20:18:28,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:28,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:28,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, 1, 1, 1] [2020-02-10 20:18:28,537 INFO L427 AbstractCegarLoop]: === Iteration 647 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:28,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash 694734477, now seen corresponding path program 640 times [2020-02-10 20:18:28,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:28,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36557049] [2020-02-10 20:18:28,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:28,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:28,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36557049] [2020-02-10 20:18:28,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:28,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:28,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532294323] [2020-02-10 20:18:28,968 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:28,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:28,968 INFO L87 Difference]: Start difference. First operand 805 states and 3168 transitions. Second operand 10 states. [2020-02-10 20:18:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,094 INFO L93 Difference]: Finished difference Result 1477 states and 5083 transitions. [2020-02-10 20:18:29,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:29,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:29,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,098 INFO L225 Difference]: With dead ends: 1477 [2020-02-10 20:18:29,098 INFO L226 Difference]: Without dead ends: 1452 [2020-02-10 20:18:29,099 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:29,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1452 states. [2020-02-10 20:18:29,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1452 to 798. [2020-02-10 20:18:29,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:29,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3148 transitions. [2020-02-10 20:18:29,122 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3148 transitions. Word has length 25 [2020-02-10 20:18:29,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,122 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3148 transitions. [2020-02-10 20:18:29,122 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:29,122 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3148 transitions. [2020-02-10 20:18:29,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:29,123 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,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, 1, 1, 1] [2020-02-10 20:18:29,123 INFO L427 AbstractCegarLoop]: === Iteration 648 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1433055851, now seen corresponding path program 641 times [2020-02-10 20:18:29,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,124 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578150793] [2020-02-10 20:18:29,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:29,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 20:18:29,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578150793] [2020-02-10 20:18:29,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:29,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:29,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114439274] [2020-02-10 20:18:29,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:29,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:29,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:29,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:29,535 INFO L87 Difference]: Start difference. First operand 798 states and 3148 transitions. Second operand 10 states. [2020-02-10 20:18:29,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:29,700 INFO L93 Difference]: Finished difference Result 1478 states and 5085 transitions. [2020-02-10 20:18:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:29,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:29,704 INFO L225 Difference]: With dead ends: 1478 [2020-02-10 20:18:29,704 INFO L226 Difference]: Without dead ends: 1462 [2020-02-10 20:18:29,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1462 states. [2020-02-10 20:18:29,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1462 to 807. [2020-02-10 20:18:29,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:18:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3164 transitions. [2020-02-10 20:18:29,727 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3164 transitions. Word has length 25 [2020-02-10 20:18:29,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:29,727 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3164 transitions. [2020-02-10 20:18:29,727 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:29,727 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3164 transitions. [2020-02-10 20:18:29,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:29,728 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:29,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, 1, 1, 1] [2020-02-10 20:18:29,728 INFO L427 AbstractCegarLoop]: === Iteration 649 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:29,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:29,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1788826065, now seen corresponding path program 642 times [2020-02-10 20:18:29,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:29,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340718397] [2020-02-10 20:18:29,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340718397] [2020-02-10 20:18:30,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:30,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671413020] [2020-02-10 20:18:30,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:30,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:30,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:30,145 INFO L87 Difference]: Start difference. First operand 807 states and 3164 transitions. Second operand 10 states. [2020-02-10 20:18:30,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:30,283 INFO L93 Difference]: Finished difference Result 1480 states and 5081 transitions. [2020-02-10 20:18:30,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:30,283 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:30,287 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:18:30,287 INFO L226 Difference]: Without dead ends: 1444 [2020-02-10 20:18:30,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:30,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1444 states. [2020-02-10 20:18:30,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1444 to 789. [2020-02-10 20:18:30,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2020-02-10 20:18:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 3126 transitions. [2020-02-10 20:18:30,309 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 3126 transitions. Word has length 25 [2020-02-10 20:18:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:30,310 INFO L479 AbstractCegarLoop]: Abstraction has 789 states and 3126 transitions. [2020-02-10 20:18:30,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:30,310 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 3126 transitions. [2020-02-10 20:18:30,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:30,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:30,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, 1, 1, 1] [2020-02-10 20:18:30,311 INFO L427 AbstractCegarLoop]: === Iteration 650 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:30,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:30,311 INFO L82 PathProgramCache]: Analyzing trace with hash -611616465, now seen corresponding path program 643 times [2020-02-10 20:18:30,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:30,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140691931] [2020-02-10 20:18:30,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:30,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:30,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:30,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140691931] [2020-02-10 20:18:30,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:30,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:30,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254893885] [2020-02-10 20:18:30,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:30,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:30,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:30,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:30,724 INFO L87 Difference]: Start difference. First operand 789 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:18:30,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:30,892 INFO L93 Difference]: Finished difference Result 1449 states and 5021 transitions. [2020-02-10 20:18:30,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:30,892 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:30,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:30,896 INFO L225 Difference]: With dead ends: 1449 [2020-02-10 20:18:30,896 INFO L226 Difference]: Without dead ends: 1437 [2020-02-10 20:18:30,896 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:30,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1437 states. [2020-02-10 20:18:30,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1437 to 797. [2020-02-10 20:18:30,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:30,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3147 transitions. [2020-02-10 20:18:30,919 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3147 transitions. Word has length 25 [2020-02-10 20:18:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:30,919 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3147 transitions. [2020-02-10 20:18:30,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3147 transitions. [2020-02-10 20:18:30,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:30,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:30,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, 1, 1, 1] [2020-02-10 20:18:30,920 INFO L427 AbstractCegarLoop]: === Iteration 651 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:30,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:30,921 INFO L82 PathProgramCache]: Analyzing trace with hash 999324493, now seen corresponding path program 644 times [2020-02-10 20:18:30,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:30,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96183564] [2020-02-10 20:18:30,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:30,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96183564] [2020-02-10 20:18:31,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:31,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668211511] [2020-02-10 20:18:31,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:31,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:31,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:31,318 INFO L87 Difference]: Start difference. First operand 797 states and 3147 transitions. Second operand 10 states. [2020-02-10 20:18:31,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:31,457 INFO L93 Difference]: Finished difference Result 1453 states and 5026 transitions. [2020-02-10 20:18:31,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:31,457 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:31,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:31,461 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:18:31,461 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:18:31,461 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:18:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 794. [2020-02-10 20:18:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:31,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3139 transitions. [2020-02-10 20:18:31,484 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3139 transitions. Word has length 25 [2020-02-10 20:18:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:31,484 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3139 transitions. [2020-02-10 20:18:31,484 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3139 transitions. [2020-02-10 20:18:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:31,485 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:31,485 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:31,485 INFO L427 AbstractCegarLoop]: === Iteration 652 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash 482475123, now seen corresponding path program 645 times [2020-02-10 20:18:31,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:31,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248066307] [2020-02-10 20:18:31,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:31,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:31,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248066307] [2020-02-10 20:18:31,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:31,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:31,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184223754] [2020-02-10 20:18:31,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:31,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:31,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:31,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:31,894 INFO L87 Difference]: Start difference. First operand 794 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:18:32,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,027 INFO L93 Difference]: Finished difference Result 1452 states and 5023 transitions. [2020-02-10 20:18:32,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:32,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:32,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,032 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:18:32,032 INFO L226 Difference]: Without dead ends: 1440 [2020-02-10 20:18:32,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:32,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1440 states. [2020-02-10 20:18:32,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1440 to 798. [2020-02-10 20:18:32,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:32,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3146 transitions. [2020-02-10 20:18:32,054 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3146 transitions. Word has length 25 [2020-02-10 20:18:32,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,055 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3146 transitions. [2020-02-10 20:18:32,055 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:32,055 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3146 transitions. [2020-02-10 20:18:32,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:32,056 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:32,056 INFO L427 AbstractCegarLoop]: === Iteration 653 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1020330701, now seen corresponding path program 646 times [2020-02-10 20:18:32,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711091869] [2020-02-10 20:18:32,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:32,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 20:18:32,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711091869] [2020-02-10 20:18:32,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:32,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:32,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15995188] [2020-02-10 20:18:32,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:32,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:32,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:32,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:32,458 INFO L87 Difference]: Start difference. First operand 798 states and 3146 transitions. Second operand 10 states. [2020-02-10 20:18:32,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:32,591 INFO L93 Difference]: Finished difference Result 1458 states and 5031 transitions. [2020-02-10 20:18:32,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:32,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:32,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:32,595 INFO L225 Difference]: With dead ends: 1458 [2020-02-10 20:18:32,595 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:18:32,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:32,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:18:32,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 794. [2020-02-10 20:18:32,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3135 transitions. [2020-02-10 20:18:32,619 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3135 transitions. Word has length 25 [2020-02-10 20:18:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:32,619 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3135 transitions. [2020-02-10 20:18:32,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:32,619 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3135 transitions. [2020-02-10 20:18:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:32,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:32,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, 1, 1, 1] [2020-02-10 20:18:32,620 INFO L427 AbstractCegarLoop]: === Iteration 654 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:32,620 INFO L82 PathProgramCache]: Analyzing trace with hash 492978227, now seen corresponding path program 647 times [2020-02-10 20:18:32,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:32,621 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028343759] [2020-02-10 20:18:32,621 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:32,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:33,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:33,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028343759] [2020-02-10 20:18:33,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:33,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:33,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517434520] [2020-02-10 20:18:33,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:33,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:33,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:33,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:33,044 INFO L87 Difference]: Start difference. First operand 794 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:18:33,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,205 INFO L93 Difference]: Finished difference Result 1465 states and 5048 transitions. [2020-02-10 20:18:33,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:33,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:33,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,209 INFO L225 Difference]: With dead ends: 1465 [2020-02-10 20:18:33,209 INFO L226 Difference]: Without dead ends: 1449 [2020-02-10 20:18:33,210 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:33,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1449 states. [2020-02-10 20:18:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1449 to 803. [2020-02-10 20:18:33,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:18:33,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3151 transitions. [2020-02-10 20:18:33,232 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3151 transitions. Word has length 25 [2020-02-10 20:18:33,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,232 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3151 transitions. [2020-02-10 20:18:33,232 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:33,232 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3151 transitions. [2020-02-10 20:18:33,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:33,233 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,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, 1, 1, 1] [2020-02-10 20:18:33,233 INFO L427 AbstractCegarLoop]: === Iteration 655 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,234 INFO L82 PathProgramCache]: Analyzing trace with hash -580107153, now seen corresponding path program 648 times [2020-02-10 20:18:33,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213366621] [2020-02-10 20:18:33,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:33,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213366621] [2020-02-10 20:18:33,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:33,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:33,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438737106] [2020-02-10 20:18:33,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:33,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:33,648 INFO L87 Difference]: Start difference. First operand 803 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:18:33,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:33,751 INFO L93 Difference]: Finished difference Result 1467 states and 5044 transitions. [2020-02-10 20:18:33,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:33,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:33,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:33,756 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:18:33,756 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:18:33,756 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:33,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:18:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 783. [2020-02-10 20:18:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:18:33,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 20:18:33,778 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 20:18:33,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:33,778 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 20:18:33,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:33,778 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 20:18:33,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:33,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:33,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, 1, 1, 1] [2020-02-10 20:18:33,780 INFO L427 AbstractCegarLoop]: === Iteration 656 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:33,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:33,780 INFO L82 PathProgramCache]: Analyzing trace with hash -927302379, now seen corresponding path program 649 times [2020-02-10 20:18:33,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:33,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052346918] [2020-02-10 20:18:33,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:33,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052346918] [2020-02-10 20:18:34,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:34,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927841981] [2020-02-10 20:18:34,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:34,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:34,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:34,193 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:18:34,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:34,382 INFO L93 Difference]: Finished difference Result 1427 states and 4979 transitions. [2020-02-10 20:18:34,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:34,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:34,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:34,386 INFO L225 Difference]: With dead ends: 1427 [2020-02-10 20:18:34,386 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:18:34,386 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:34,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:18:34,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 793. [2020-02-10 20:18:34,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:34,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3144 transitions. [2020-02-10 20:18:34,410 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3144 transitions. Word has length 25 [2020-02-10 20:18:34,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:34,411 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3144 transitions. [2020-02-10 20:18:34,411 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:34,411 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3144 transitions. [2020-02-10 20:18:34,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:34,412 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:34,412 INFO L427 AbstractCegarLoop]: === Iteration 657 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:34,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:34,412 INFO L82 PathProgramCache]: Analyzing trace with hash 683638579, now seen corresponding path program 650 times [2020-02-10 20:18:34,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:34,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558147908] [2020-02-10 20:18:34,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:34,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:34,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558147908] [2020-02-10 20:18:34,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:34,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:34,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971908588] [2020-02-10 20:18:34,807 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:34,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:34,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:34,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:34,807 INFO L87 Difference]: Start difference. First operand 793 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:18:35,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:35,004 INFO L93 Difference]: Finished difference Result 1424 states and 4970 transitions. [2020-02-10 20:18:35,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:35,004 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:35,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:35,007 INFO L225 Difference]: With dead ends: 1424 [2020-02-10 20:18:35,008 INFO L226 Difference]: Without dead ends: 1409 [2020-02-10 20:18:35,008 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:35,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2020-02-10 20:18:35,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 790. [2020-02-10 20:18:35,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:18:35,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3136 transitions. [2020-02-10 20:18:35,030 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3136 transitions. Word has length 25 [2020-02-10 20:18:35,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:35,030 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3136 transitions. [2020-02-10 20:18:35,030 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:35,030 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3136 transitions. [2020-02-10 20:18:35,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:35,031 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:35,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, 1, 1, 1] [2020-02-10 20:18:35,031 INFO L427 AbstractCegarLoop]: === Iteration 658 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:35,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:35,031 INFO L82 PathProgramCache]: Analyzing trace with hash 166789209, now seen corresponding path program 651 times [2020-02-10 20:18:35,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:35,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928920913] [2020-02-10 20:18:35,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:35,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928920913] [2020-02-10 20:18:35,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:35,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:35,428 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937517417] [2020-02-10 20:18:35,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:35,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:35,429 INFO L87 Difference]: Start difference. First operand 790 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:18:35,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:35,585 INFO L93 Difference]: Finished difference Result 1431 states and 4986 transitions. [2020-02-10 20:18:35,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:35,585 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:35,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:35,589 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:18:35,589 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:18:35,589 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:18:35,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 795. [2020-02-10 20:18:35,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:35,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3145 transitions. [2020-02-10 20:18:35,613 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3145 transitions. Word has length 25 [2020-02-10 20:18:35,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:35,613 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3145 transitions. [2020-02-10 20:18:35,613 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:35,613 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3145 transitions. [2020-02-10 20:18:35,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:35,614 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:35,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, 1, 1, 1] [2020-02-10 20:18:35,614 INFO L427 AbstractCegarLoop]: === Iteration 659 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:35,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:35,614 INFO L82 PathProgramCache]: Analyzing trace with hash 704644787, now seen corresponding path program 652 times [2020-02-10 20:18:35,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:35,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813730669] [2020-02-10 20:18:35,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:35,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813730669] [2020-02-10 20:18:36,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:36,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138330380] [2020-02-10 20:18:36,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:36,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:36,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:36,009 INFO L87 Difference]: Start difference. First operand 795 states and 3145 transitions. Second operand 10 states. [2020-02-10 20:18:36,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,194 INFO L93 Difference]: Finished difference Result 1430 states and 4979 transitions. [2020-02-10 20:18:36,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:36,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:36,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,198 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:18:36,198 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:18:36,199 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:36,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:18:36,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 790. [2020-02-10 20:18:36,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2020-02-10 20:18:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 3133 transitions. [2020-02-10 20:18:36,222 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 3133 transitions. Word has length 25 [2020-02-10 20:18:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,222 INFO L479 AbstractCegarLoop]: Abstraction has 790 states and 3133 transitions. [2020-02-10 20:18:36,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:36,222 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 3133 transitions. [2020-02-10 20:18:36,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:36,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,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, 1, 1, 1] [2020-02-10 20:18:36,223 INFO L427 AbstractCegarLoop]: === Iteration 660 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,223 INFO L82 PathProgramCache]: Analyzing trace with hash 177292313, now seen corresponding path program 653 times [2020-02-10 20:18:36,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735561799] [2020-02-10 20:18:36,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:36,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735561799] [2020-02-10 20:18:36,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:36,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:36,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562121756] [2020-02-10 20:18:36,612 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:36,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:36,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:36,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:36,612 INFO L87 Difference]: Start difference. First operand 790 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:18:36,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:36,797 INFO L93 Difference]: Finished difference Result 1423 states and 4965 transitions. [2020-02-10 20:18:36,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:36,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:36,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:36,801 INFO L225 Difference]: With dead ends: 1423 [2020-02-10 20:18:36,801 INFO L226 Difference]: Without dead ends: 1411 [2020-02-10 20:18:36,801 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:36,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1411 states. [2020-02-10 20:18:36,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1411 to 793. [2020-02-10 20:18:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 20:18:36,833 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:36,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:36,833 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 20:18:36,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:36,834 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 20:18:36,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:36,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:36,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, 1, 1, 1] [2020-02-10 20:18:36,835 INFO L427 AbstractCegarLoop]: === Iteration 661 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:36,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:36,835 INFO L82 PathProgramCache]: Analyzing trace with hash -895793067, now seen corresponding path program 654 times [2020-02-10 20:18:36,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:36,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994545861] [2020-02-10 20:18:36,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:36,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:37,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:37,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994545861] [2020-02-10 20:18:37,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:37,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:37,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107532437] [2020-02-10 20:18:37,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:37,221 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:37,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:37,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:37,221 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:37,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:37,391 INFO L93 Difference]: Finished difference Result 1425 states and 4966 transitions. [2020-02-10 20:18:37,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:37,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:37,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:37,394 INFO L225 Difference]: With dead ends: 1425 [2020-02-10 20:18:37,395 INFO L226 Difference]: Without dead ends: 1405 [2020-02-10 20:18:37,395 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:37,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1405 states. [2020-02-10 20:18:37,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1405 to 787. [2020-02-10 20:18:37,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:18:37,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3125 transitions. [2020-02-10 20:18:37,417 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3125 transitions. Word has length 25 [2020-02-10 20:18:37,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:37,417 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3125 transitions. [2020-02-10 20:18:37,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3125 transitions. [2020-02-10 20:18:37,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:37,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:37,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, 1, 1, 1] [2020-02-10 20:18:37,418 INFO L427 AbstractCegarLoop]: === Iteration 662 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:37,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:37,419 INFO L82 PathProgramCache]: Analyzing trace with hash 998731699, now seen corresponding path program 655 times [2020-02-10 20:18:37,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:37,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549971366] [2020-02-10 20:18:37,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:37,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:37,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549971366] [2020-02-10 20:18:37,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:37,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:37,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526528213] [2020-02-10 20:18:37,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:37,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:37,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:37,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:37,830 INFO L87 Difference]: Start difference. First operand 787 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:18:38,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,022 INFO L93 Difference]: Finished difference Result 1435 states and 4993 transitions. [2020-02-10 20:18:38,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:38,023 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:38,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,026 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:18:38,027 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:18:38,027 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:18:38,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 20:18:38,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:38,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3144 transitions. [2020-02-10 20:18:38,050 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3144 transitions. Word has length 25 [2020-02-10 20:18:38,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,050 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3144 transitions. [2020-02-10 20:18:38,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3144 transitions. [2020-02-10 20:18:38,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:38,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:38,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:38,051 INFO L427 AbstractCegarLoop]: === Iteration 663 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,052 INFO L82 PathProgramCache]: Analyzing trace with hash -1685294639, now seen corresponding path program 656 times [2020-02-10 20:18:38,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943353417] [2020-02-10 20:18:38,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:38,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:38,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943353417] [2020-02-10 20:18:38,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:38,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:38,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507237471] [2020-02-10 20:18:38,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:38,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:38,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:38,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:38,451 INFO L87 Difference]: Start difference. First operand 794 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:18:38,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:38,601 INFO L93 Difference]: Finished difference Result 1432 states and 4984 transitions. [2020-02-10 20:18:38,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:38,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:38,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:38,605 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:18:38,605 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:18:38,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:38,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:18:38,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 20:18:38,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:38,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3136 transitions. [2020-02-10 20:18:38,628 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3136 transitions. Word has length 25 [2020-02-10 20:18:38,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:38,628 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3136 transitions. [2020-02-10 20:18:38,628 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:38,628 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3136 transitions. [2020-02-10 20:18:38,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:38,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:38,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, 1, 1, 1] [2020-02-10 20:18:38,640 INFO L427 AbstractCegarLoop]: === Iteration 664 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:38,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:38,640 INFO L82 PathProgramCache]: Analyzing trace with hash 492385433, now seen corresponding path program 657 times [2020-02-10 20:18:38,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:38,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456568553] [2020-02-10 20:18:38,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:38,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:39,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456568553] [2020-02-10 20:18:39,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:39,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863912665] [2020-02-10 20:18:39,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:39,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:39,028 INFO L87 Difference]: Start difference. First operand 791 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:18:39,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:39,199 INFO L93 Difference]: Finished difference Result 1445 states and 5012 transitions. [2020-02-10 20:18:39,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:39,199 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:39,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:39,202 INFO L225 Difference]: With dead ends: 1445 [2020-02-10 20:18:39,203 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:18:39,203 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:39,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:18:39,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 798. [2020-02-10 20:18:39,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:39,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3149 transitions. [2020-02-10 20:18:39,225 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3149 transitions. Word has length 25 [2020-02-10 20:18:39,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:39,225 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3149 transitions. [2020-02-10 20:18:39,225 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:39,225 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3149 transitions. [2020-02-10 20:18:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:39,226 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:39,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, 1, 1, 1] [2020-02-10 20:18:39,226 INFO L427 AbstractCegarLoop]: === Iteration 665 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:39,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:39,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1653785327, now seen corresponding path program 658 times [2020-02-10 20:18:39,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:39,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090608613] [2020-02-10 20:18:39,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:39,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 20:18:39,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090608613] [2020-02-10 20:18:39,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:39,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:39,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438474251] [2020-02-10 20:18:39,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:39,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:39,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:39,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:39,630 INFO L87 Difference]: Start difference. First operand 798 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:18:39,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:39,755 INFO L93 Difference]: Finished difference Result 1448 states and 5011 transitions. [2020-02-10 20:18:39,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:39,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:39,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:39,758 INFO L225 Difference]: With dead ends: 1448 [2020-02-10 20:18:39,759 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:18:39,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:39,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:18:39,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 791. [2020-02-10 20:18:39,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:39,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3132 transitions. [2020-02-10 20:18:39,781 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3132 transitions. Word has length 25 [2020-02-10 20:18:39,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:39,781 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3132 transitions. [2020-02-10 20:18:39,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:39,781 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3132 transitions. [2020-02-10 20:18:39,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:39,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:39,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, 1, 1, 1] [2020-02-10 20:18:39,782 INFO L427 AbstractCegarLoop]: === Iteration 666 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:39,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:39,782 INFO L82 PathProgramCache]: Analyzing trace with hash 502888537, now seen corresponding path program 659 times [2020-02-10 20:18:39,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:39,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619180891] [2020-02-10 20:18:39,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:39,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:40,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:40,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619180891] [2020-02-10 20:18:40,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:40,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:40,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142189232] [2020-02-10 20:18:40,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:40,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:40,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:40,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:40,176 INFO L87 Difference]: Start difference. First operand 791 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:18:40,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,331 INFO L93 Difference]: Finished difference Result 1436 states and 4987 transitions. [2020-02-10 20:18:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:40,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:40,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,334 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:18:40,335 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:18:40,335 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:18:40,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 795. [2020-02-10 20:18:40,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3139 transitions. [2020-02-10 20:18:40,356 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3139 transitions. Word has length 25 [2020-02-10 20:18:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,367 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3139 transitions. [2020-02-10 20:18:40,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3139 transitions. [2020-02-10 20:18:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:40,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,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, 1, 1, 1] [2020-02-10 20:18:40,369 INFO L427 AbstractCegarLoop]: === Iteration 667 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1040744115, now seen corresponding path program 660 times [2020-02-10 20:18:40,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798452748] [2020-02-10 20:18:40,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:40,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:40,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798452748] [2020-02-10 20:18:40,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:40,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:40,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932421416] [2020-02-10 20:18:40,774 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:40,774 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:40,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:40,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:40,774 INFO L87 Difference]: Start difference. First operand 795 states and 3139 transitions. Second operand 10 states. [2020-02-10 20:18:40,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:40,894 INFO L93 Difference]: Finished difference Result 1442 states and 4995 transitions. [2020-02-10 20:18:40,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:40,895 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:40,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:40,898 INFO L225 Difference]: With dead ends: 1442 [2020-02-10 20:18:40,898 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:18:40,899 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:18:40,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 787. [2020-02-10 20:18:40,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:18:40,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3121 transitions. [2020-02-10 20:18:40,921 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3121 transitions. Word has length 25 [2020-02-10 20:18:40,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:40,921 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3121 transitions. [2020-02-10 20:18:40,921 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3121 transitions. [2020-02-10 20:18:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:40,922 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:40,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, 1, 1, 1] [2020-02-10 20:18:40,922 INFO L427 AbstractCegarLoop]: === Iteration 668 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:40,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1649924147, now seen corresponding path program 661 times [2020-02-10 20:18:40,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:40,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195367060] [2020-02-10 20:18:40,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:40,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195367060] [2020-02-10 20:18:41,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:41,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289589238] [2020-02-10 20:18:41,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:41,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:41,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:41,321 INFO L87 Difference]: Start difference. First operand 787 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:18:41,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:41,506 INFO L93 Difference]: Finished difference Result 1447 states and 5023 transitions. [2020-02-10 20:18:41,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:41,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:41,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:41,510 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:18:41,510 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:18:41,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:18:41,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 20:18:41,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:41,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3152 transitions. [2020-02-10 20:18:41,532 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3152 transitions. Word has length 25 [2020-02-10 20:18:41,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:41,532 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3152 transitions. [2020-02-10 20:18:41,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:41,532 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3152 transitions. [2020-02-10 20:18:41,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:41,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:41,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, 1, 1, 1] [2020-02-10 20:18:41,533 INFO L427 AbstractCegarLoop]: === Iteration 669 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:41,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:41,534 INFO L82 PathProgramCache]: Analyzing trace with hash -2107187571, now seen corresponding path program 662 times [2020-02-10 20:18:41,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:41,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714367377] [2020-02-10 20:18:41,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:41,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:41,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714367377] [2020-02-10 20:18:41,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:41,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:41,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685005441] [2020-02-10 20:18:41,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:41,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:41,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:41,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:41,929 INFO L87 Difference]: Start difference. First operand 798 states and 3152 transitions. Second operand 10 states. [2020-02-10 20:18:42,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:42,111 INFO L93 Difference]: Finished difference Result 1446 states and 5016 transitions. [2020-02-10 20:18:42,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:42,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:42,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:42,115 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:18:42,116 INFO L226 Difference]: Without dead ends: 1427 [2020-02-10 20:18:42,116 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:42,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1427 states. [2020-02-10 20:18:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1427 to 793. [2020-02-10 20:18:42,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3138 transitions. [2020-02-10 20:18:42,138 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:42,138 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3138 transitions. [2020-02-10 20:18:42,138 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:42,139 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3138 transitions. [2020-02-10 20:18:42,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:42,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:42,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:42,140 INFO L427 AbstractCegarLoop]: === Iteration 670 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:42,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:42,140 INFO L82 PathProgramCache]: Analyzing trace with hash 49486293, now seen corresponding path program 663 times [2020-02-10 20:18:42,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:42,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653531479] [2020-02-10 20:18:42,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:42,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:42,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 20:18:42,536 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653531479] [2020-02-10 20:18:42,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:42,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:42,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653703357] [2020-02-10 20:18:42,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:42,536 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:42,537 INFO L87 Difference]: Start difference. First operand 793 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:42,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:42,726 INFO L93 Difference]: Finished difference Result 1453 states and 5030 transitions. [2020-02-10 20:18:42,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:42,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:42,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:42,730 INFO L225 Difference]: With dead ends: 1453 [2020-02-10 20:18:42,730 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:18:42,731 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:42,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:18:42,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 800. [2020-02-10 20:18:42,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:18:42,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3151 transitions. [2020-02-10 20:18:42,754 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3151 transitions. Word has length 25 [2020-02-10 20:18:42,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:42,754 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3151 transitions. [2020-02-10 20:18:42,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3151 transitions. [2020-02-10 20:18:42,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:42,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:42,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, 1, 1, 1] [2020-02-10 20:18:42,755 INFO L427 AbstractCegarLoop]: === Iteration 671 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:42,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:42,755 INFO L82 PathProgramCache]: Analyzing trace with hash -2096684467, now seen corresponding path program 664 times [2020-02-10 20:18:42,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:42,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256386360] [2020-02-10 20:18:42,756 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,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 20:18:43,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256386360] [2020-02-10 20:18:43,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:43,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462816376] [2020-02-10 20:18:43,158 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:43,158 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:43,159 INFO L87 Difference]: Start difference. First operand 800 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:18:43,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,278 INFO L93 Difference]: Finished difference Result 1456 states and 5029 transitions. [2020-02-10 20:18:43,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:43,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:43,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,281 INFO L225 Difference]: With dead ends: 1456 [2020-02-10 20:18:43,282 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:18:43,282 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:18:43,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 793. [2020-02-10 20:18:43,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:18:43,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3132 transitions. [2020-02-10 20:18:43,304 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3132 transitions. Word has length 25 [2020-02-10 20:18:43,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,304 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3132 transitions. [2020-02-10 20:18:43,304 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3132 transitions. [2020-02-10 20:18:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:43,305 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,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, 1, 1, 1] [2020-02-10 20:18:43,305 INFO L427 AbstractCegarLoop]: === Iteration 672 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,305 INFO L82 PathProgramCache]: Analyzing trace with hash 80995605, now seen corresponding path program 665 times [2020-02-10 20:18:43,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843247730] [2020-02-10 20:18:43,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:43,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:43,697 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843247730] [2020-02-10 20:18:43,697 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:43,697 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:43,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920485976] [2020-02-10 20:18:43,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:43,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:43,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:43,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:43,698 INFO L87 Difference]: Start difference. First operand 793 states and 3132 transitions. Second operand 10 states. [2020-02-10 20:18:43,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:43,867 INFO L93 Difference]: Finished difference Result 1450 states and 5017 transitions. [2020-02-10 20:18:43,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:43,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:43,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:43,871 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:18:43,871 INFO L226 Difference]: Without dead ends: 1436 [2020-02-10 20:18:43,872 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:43,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1436 states. [2020-02-10 20:18:43,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1436 to 799. [2020-02-10 20:18:43,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:18:43,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3143 transitions. [2020-02-10 20:18:43,894 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3143 transitions. Word has length 25 [2020-02-10 20:18:43,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:43,894 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3143 transitions. [2020-02-10 20:18:43,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:43,894 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3143 transitions. [2020-02-10 20:18:43,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:43,896 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:43,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, 1, 1, 1] [2020-02-10 20:18:43,896 INFO L427 AbstractCegarLoop]: === Iteration 673 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:43,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:43,896 INFO L82 PathProgramCache]: Analyzing trace with hash 1691936563, now seen corresponding path program 666 times [2020-02-10 20:18:43,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:43,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639885189] [2020-02-10 20:18:43,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639885189] [2020-02-10 20:18:44,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:44,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984699595] [2020-02-10 20:18:44,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:44,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:44,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:44,296 INFO L87 Difference]: Start difference. First operand 799 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:18:44,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:44,417 INFO L93 Difference]: Finished difference Result 1454 states and 5019 transitions. [2020-02-10 20:18:44,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:44,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:44,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:44,421 INFO L225 Difference]: With dead ends: 1454 [2020-02-10 20:18:44,422 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:18:44,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:44,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:18:44,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 787. [2020-02-10 20:18:44,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:18:44,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3117 transitions. [2020-02-10 20:18:44,444 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3117 transitions. Word has length 25 [2020-02-10 20:18:44,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:44,444 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3117 transitions. [2020-02-10 20:18:44,444 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:44,444 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3117 transitions. [2020-02-10 20:18:44,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:44,445 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:44,445 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:44,446 INFO L427 AbstractCegarLoop]: === Iteration 674 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:44,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:44,446 INFO L82 PathProgramCache]: Analyzing trace with hash -708505967, now seen corresponding path program 667 times [2020-02-10 20:18:44,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:44,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81133979] [2020-02-10 20:18:44,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:44,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:44,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81133979] [2020-02-10 20:18:44,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:44,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:44,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975786929] [2020-02-10 20:18:44,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:44,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:44,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:44,835 INFO L87 Difference]: Start difference. First operand 787 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:18:44,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:44,983 INFO L93 Difference]: Finished difference Result 1429 states and 4972 transitions. [2020-02-10 20:18:44,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:44,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:44,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:44,987 INFO L225 Difference]: With dead ends: 1429 [2020-02-10 20:18:44,987 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:18:44,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:44,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:18:45,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 794. [2020-02-10 20:18:45,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:18:45,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 20:18:45,009 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 20:18:45,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,009 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 20:18:45,009 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:45,009 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 20:18:45,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:45,010 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,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, 1, 1, 1] [2020-02-10 20:18:45,011 INFO L427 AbstractCegarLoop]: === Iteration 675 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1781591347, now seen corresponding path program 668 times [2020-02-10 20:18:45,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078018117] [2020-02-10 20:18:45,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:45,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:45,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078018117] [2020-02-10 20:18:45,412 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:45,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:45,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158202078] [2020-02-10 20:18:45,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:45,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:45,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:45,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:45,413 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:18:45,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:45,595 INFO L93 Difference]: Finished difference Result 1431 states and 4973 transitions. [2020-02-10 20:18:45,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:45,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:45,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:45,599 INFO L225 Difference]: With dead ends: 1431 [2020-02-10 20:18:45,599 INFO L226 Difference]: Without dead ends: 1414 [2020-02-10 20:18:45,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:45,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1414 states. [2020-02-10 20:18:45,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1414 to 791. [2020-02-10 20:18:45,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:45,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 20:18:45,622 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 20:18:45,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:45,622 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 20:18:45,622 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:45,622 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 20:18:45,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:45,623 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:45,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, 1, 1, 1] [2020-02-10 20:18:45,623 INFO L427 AbstractCegarLoop]: === Iteration 676 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:45,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:45,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1986023475, now seen corresponding path program 669 times [2020-02-10 20:18:45,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:45,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322232229] [2020-02-10 20:18:45,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:46,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322232229] [2020-02-10 20:18:46,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:46,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619783406] [2020-02-10 20:18:46,009 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:46,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:46,010 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:18:46,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,195 INFO L93 Difference]: Finished difference Result 1434 states and 4978 transitions. [2020-02-10 20:18:46,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:46,196 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,200 INFO L225 Difference]: With dead ends: 1434 [2020-02-10 20:18:46,200 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:18:46,200 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:46,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:18:46,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 795. [2020-02-10 20:18:46,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:18:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3135 transitions. [2020-02-10 20:18:46,223 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3135 transitions. Word has length 25 [2020-02-10 20:18:46,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,223 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3135 transitions. [2020-02-10 20:18:46,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:46,223 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3135 transitions. [2020-02-10 20:18:46,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:46,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,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, 1, 1, 1] [2020-02-10 20:18:46,224 INFO L427 AbstractCegarLoop]: === Iteration 677 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1771088243, now seen corresponding path program 670 times [2020-02-10 20:18:46,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906715860] [2020-02-10 20:18:46,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:46,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 20:18:46,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906715860] [2020-02-10 20:18:46,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:46,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:46,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643054328] [2020-02-10 20:18:46,614 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:46,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:46,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:46,614 INFO L87 Difference]: Start difference. First operand 795 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:18:46,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:46,723 INFO L93 Difference]: Finished difference Result 1440 states and 4986 transitions. [2020-02-10 20:18:46,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:46,724 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:46,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:46,726 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:18:46,726 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:18:46,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:46,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:18:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 791. [2020-02-10 20:18:46,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:18:46,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3124 transitions. [2020-02-10 20:18:46,750 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3124 transitions. Word has length 25 [2020-02-10 20:18:46,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:46,750 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3124 transitions. [2020-02-10 20:18:46,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3124 transitions. [2020-02-10 20:18:46,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:46,751 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:46,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, 1, 1, 1] [2020-02-10 20:18:46,752 INFO L427 AbstractCegarLoop]: === Iteration 678 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:46,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:46,752 INFO L82 PathProgramCache]: Analyzing trace with hash 2007029683, now seen corresponding path program 671 times [2020-02-10 20:18:46,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:46,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085426338] [2020-02-10 20:18:46,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:46,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:47,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:47,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085426338] [2020-02-10 20:18:47,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:47,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:47,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048998198] [2020-02-10 20:18:47,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:47,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:47,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:47,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:47,152 INFO L87 Difference]: Start difference. First operand 791 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:18:47,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:47,305 INFO L93 Difference]: Finished difference Result 1440 states and 4988 transitions. [2020-02-10 20:18:47,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:47,305 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:47,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:47,309 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:18:47,309 INFO L226 Difference]: Without dead ends: 1426 [2020-02-10 20:18:47,309 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:47,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1426 states. [2020-02-10 20:18:47,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1426 to 797. [2020-02-10 20:18:47,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:47,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3135 transitions. [2020-02-10 20:18:47,332 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3135 transitions. Word has length 25 [2020-02-10 20:18:47,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:47,332 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3135 transitions. [2020-02-10 20:18:47,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:47,332 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3135 transitions. [2020-02-10 20:18:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:47,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:47,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, 1, 1, 1] [2020-02-10 20:18:47,333 INFO L427 AbstractCegarLoop]: === Iteration 679 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:47,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:47,334 INFO L82 PathProgramCache]: Analyzing trace with hash -676996655, now seen corresponding path program 672 times [2020-02-10 20:18:47,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:47,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392829813] [2020-02-10 20:18:47,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:47,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392829813] [2020-02-10 20:18:47,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:47,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:47,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683953654] [2020-02-10 20:18:47,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:47,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:47,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:47,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:47,719 INFO L87 Difference]: Start difference. First operand 797 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:18:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:47,823 INFO L93 Difference]: Finished difference Result 1444 states and 4990 transitions. [2020-02-10 20:18:47,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:47,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:47,827 INFO L225 Difference]: With dead ends: 1444 [2020-02-10 20:18:47,827 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:18:47,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:47,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:18:47,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 783. [2020-02-10 20:18:47,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:18:47,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3106 transitions. [2020-02-10 20:18:47,850 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3106 transitions. Word has length 25 [2020-02-10 20:18:47,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:47,850 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3106 transitions. [2020-02-10 20:18:47,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:47,850 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3106 transitions. [2020-02-10 20:18:47,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:47,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:47,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, 1, 1, 1] [2020-02-10 20:18:47,851 INFO L427 AbstractCegarLoop]: === Iteration 680 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:47,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:47,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1024191881, now seen corresponding path program 673 times [2020-02-10 20:18:47,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:47,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412924176] [2020-02-10 20:18:47,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:47,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412924176] [2020-02-10 20:18:48,254 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,254 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:48,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785714108] [2020-02-10 20:18:48,254 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:48,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:48,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:48,254 INFO L87 Difference]: Start difference. First operand 783 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:18:48,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:48,388 INFO L93 Difference]: Finished difference Result 1474 states and 5108 transitions. [2020-02-10 20:18:48,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:48,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:48,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:48,392 INFO L225 Difference]: With dead ends: 1474 [2020-02-10 20:18:48,392 INFO L226 Difference]: Without dead ends: 1459 [2020-02-10 20:18:48,393 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:48,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2020-02-10 20:18:48,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 803. [2020-02-10 20:18:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:18:48,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3170 transitions. [2020-02-10 20:18:48,415 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3170 transitions. Word has length 25 [2020-02-10 20:18:48,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:48,415 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3170 transitions. [2020-02-10 20:18:48,415 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:48,415 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3170 transitions. [2020-02-10 20:18:48,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:48,416 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:48,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, 1, 1, 1] [2020-02-10 20:18:48,417 INFO L427 AbstractCegarLoop]: === Iteration 681 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:48,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:48,417 INFO L82 PathProgramCache]: Analyzing trace with hash -2097277261, now seen corresponding path program 674 times [2020-02-10 20:18:48,417 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:48,417 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957467167] [2020-02-10 20:18:48,417 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:48,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:48,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:48,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957467167] [2020-02-10 20:18:48,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:48,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:48,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401262711] [2020-02-10 20:18:48,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:48,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:48,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:48,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:48,842 INFO L87 Difference]: Start difference. First operand 803 states and 3170 transitions. Second operand 10 states. [2020-02-10 20:18:48,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:48,973 INFO L93 Difference]: Finished difference Result 1475 states and 5104 transitions. [2020-02-10 20:18:48,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:48,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:48,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:48,977 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:18:48,977 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:18:48,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:48,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:18:48,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 797. [2020-02-10 20:18:48,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3154 transitions. [2020-02-10 20:18:49,000 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3154 transitions. Word has length 25 [2020-02-10 20:18:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,000 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3154 transitions. [2020-02-10 20:18:49,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:49,000 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3154 transitions. [2020-02-10 20:18:49,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:49,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,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, 1, 1, 1] [2020-02-10 20:18:49,001 INFO L427 AbstractCegarLoop]: === Iteration 682 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1670337561, now seen corresponding path program 675 times [2020-02-10 20:18:49,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207285549] [2020-02-10 20:18:49,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:49,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207285549] [2020-02-10 20:18:49,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:49,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:49,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788614138] [2020-02-10 20:18:49,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:49,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:49,405 INFO L87 Difference]: Start difference. First operand 797 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:18:49,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:49,549 INFO L93 Difference]: Finished difference Result 1471 states and 5096 transitions. [2020-02-10 20:18:49,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:49,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:49,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:49,553 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:18:49,553 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:18:49,553 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:49,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:18:49,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 802. [2020-02-10 20:18:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:18:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3163 transitions. [2020-02-10 20:18:49,576 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3163 transitions. Word has length 25 [2020-02-10 20:18:49,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:49,576 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3163 transitions. [2020-02-10 20:18:49,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:49,576 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3163 transitions. [2020-02-10 20:18:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:49,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:49,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, 1, 1, 1] [2020-02-10 20:18:49,577 INFO L427 AbstractCegarLoop]: === Iteration 683 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:49,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:49,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2086774157, now seen corresponding path program 676 times [2020-02-10 20:18:49,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:49,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957145659] [2020-02-10 20:18:49,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:49,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:49,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957145659] [2020-02-10 20:18:49,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:49,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:49,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012081257] [2020-02-10 20:18:49,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:49,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:49,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:49,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:49,981 INFO L87 Difference]: Start difference. First operand 802 states and 3163 transitions. Second operand 10 states. [2020-02-10 20:18:50,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,128 INFO L93 Difference]: Finished difference Result 1470 states and 5089 transitions. [2020-02-10 20:18:50,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:50,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:50,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,132 INFO L225 Difference]: With dead ends: 1470 [2020-02-10 20:18:50,132 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:18:50,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:50,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:18:50,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 797. [2020-02-10 20:18:50,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:18:50,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3149 transitions. [2020-02-10 20:18:50,155 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3149 transitions. Word has length 25 [2020-02-10 20:18:50,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,156 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3149 transitions. [2020-02-10 20:18:50,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:50,156 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3149 transitions. [2020-02-10 20:18:50,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:50,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:50,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, 1, 1, 1] [2020-02-10 20:18:50,157 INFO L427 AbstractCegarLoop]: === Iteration 684 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1691343769, now seen corresponding path program 677 times [2020-02-10 20:18:50,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456438712] [2020-02-10 20:18:50,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:50,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:50,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456438712] [2020-02-10 20:18:50,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:50,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:50,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549903253] [2020-02-10 20:18:50,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:50,574 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:50,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:50,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:50,575 INFO L87 Difference]: Start difference. First operand 797 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:18:50,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:50,706 INFO L93 Difference]: Finished difference Result 1473 states and 5095 transitions. [2020-02-10 20:18:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:50,707 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:50,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:50,711 INFO L225 Difference]: With dead ends: 1473 [2020-02-10 20:18:50,711 INFO L226 Difference]: Without dead ends: 1457 [2020-02-10 20:18:50,711 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1457 states. [2020-02-10 20:18:50,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1457 to 802. [2020-02-10 20:18:50,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:18:50,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3158 transitions. [2020-02-10 20:18:50,733 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3158 transitions. Word has length 25 [2020-02-10 20:18:50,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:50,734 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3158 transitions. [2020-02-10 20:18:50,734 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:50,734 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3158 transitions. [2020-02-10 20:18:50,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:50,735 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:50,735 INFO L427 AbstractCegarLoop]: === Iteration 685 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:50,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:50,735 INFO L82 PathProgramCache]: Analyzing trace with hash -992682569, now seen corresponding path program 678 times [2020-02-10 20:18:50,735 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:50,735 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542272038] [2020-02-10 20:18:50,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:51,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:51,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542272038] [2020-02-10 20:18:51,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:51,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:51,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420725467] [2020-02-10 20:18:51,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:51,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:51,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:51,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:51,150 INFO L87 Difference]: Start difference. First operand 802 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:18:51,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:51,276 INFO L93 Difference]: Finished difference Result 1471 states and 5086 transitions. [2020-02-10 20:18:51,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:51,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:51,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:51,280 INFO L225 Difference]: With dead ends: 1471 [2020-02-10 20:18:51,281 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:18:51,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:51,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:18:51,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 792. [2020-02-10 20:18:51,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3135 transitions. [2020-02-10 20:18:51,303 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3135 transitions. Word has length 25 [2020-02-10 20:18:51,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:51,303 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3135 transitions. [2020-02-10 20:18:51,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3135 transitions. [2020-02-10 20:18:51,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:51,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:51,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, 1, 1, 1] [2020-02-10 20:18:51,304 INFO L427 AbstractCegarLoop]: === Iteration 686 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:51,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:51,305 INFO L82 PathProgramCache]: Analyzing trace with hash 901842197, now seen corresponding path program 679 times [2020-02-10 20:18:51,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:51,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781244275] [2020-02-10 20:18:51,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:51,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 20:18:51,720 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781244275] [2020-02-10 20:18:51,720 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:51,720 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:51,720 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450210536] [2020-02-10 20:18:51,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:51,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:51,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:51,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:51,721 INFO L87 Difference]: Start difference. First operand 792 states and 3135 transitions. Second operand 10 states. [2020-02-10 20:18:51,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:51,869 INFO L93 Difference]: Finished difference Result 1488 states and 5134 transitions. [2020-02-10 20:18:51,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:51,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:51,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:51,873 INFO L225 Difference]: With dead ends: 1488 [2020-02-10 20:18:51,874 INFO L226 Difference]: Without dead ends: 1473 [2020-02-10 20:18:51,874 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:51,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2020-02-10 20:18:51,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 807. [2020-02-10 20:18:51,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 807 states. [2020-02-10 20:18:51,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 807 states to 807 states and 3175 transitions. [2020-02-10 20:18:51,904 INFO L78 Accepts]: Start accepts. Automaton has 807 states and 3175 transitions. Word has length 25 [2020-02-10 20:18:51,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:51,904 INFO L479 AbstractCegarLoop]: Abstraction has 807 states and 3175 transitions. [2020-02-10 20:18:51,904 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:51,904 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 3175 transitions. [2020-02-10 20:18:51,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:51,905 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:51,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, 1, 1, 1] [2020-02-10 20:18:51,905 INFO L427 AbstractCegarLoop]: === Iteration 687 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:51,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:51,905 INFO L82 PathProgramCache]: Analyzing trace with hash -171243183, now seen corresponding path program 680 times [2020-02-10 20:18:51,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:51,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765132509] [2020-02-10 20:18:51,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765132509] [2020-02-10 20:18:52,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:52,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538854055] [2020-02-10 20:18:52,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:52,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:52,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:52,345 INFO L87 Difference]: Start difference. First operand 807 states and 3175 transitions. Second operand 10 states. [2020-02-10 20:18:52,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:52,473 INFO L93 Difference]: Finished difference Result 1489 states and 5130 transitions. [2020-02-10 20:18:52,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:52,473 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:52,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:52,476 INFO L225 Difference]: With dead ends: 1489 [2020-02-10 20:18:52,477 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:18:52,477 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:52,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:18:52,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 801. [2020-02-10 20:18:52,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:18:52,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3158 transitions. [2020-02-10 20:18:52,499 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3158 transitions. Word has length 25 [2020-02-10 20:18:52,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:52,499 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3158 transitions. [2020-02-10 20:18:52,499 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:52,499 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3158 transitions. [2020-02-10 20:18:52,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:52,500 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:52,501 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:52,501 INFO L427 AbstractCegarLoop]: === Iteration 688 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:52,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:52,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1995933785, now seen corresponding path program 681 times [2020-02-10 20:18:52,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:52,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977192906] [2020-02-10 20:18:52,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:52,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:52,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:52,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977192906] [2020-02-10 20:18:52,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:52,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:52,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698175724] [2020-02-10 20:18:52,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:52,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:52,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:52,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:52,945 INFO L87 Difference]: Start difference. First operand 801 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:18:53,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,074 INFO L93 Difference]: Finished difference Result 1491 states and 5133 transitions. [2020-02-10 20:18:53,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:53,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:53,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,078 INFO L225 Difference]: With dead ends: 1491 [2020-02-10 20:18:53,078 INFO L226 Difference]: Without dead ends: 1476 [2020-02-10 20:18:53,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:53,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2020-02-10 20:18:53,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 808. [2020-02-10 20:18:53,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:18:53,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3171 transitions. [2020-02-10 20:18:53,101 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3171 transitions. Word has length 25 [2020-02-10 20:18:53,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,101 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3171 transitions. [2020-02-10 20:18:53,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:53,101 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3171 transitions. [2020-02-10 20:18:53,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:53,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:53,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, 1, 1, 1] [2020-02-10 20:18:53,102 INFO L427 AbstractCegarLoop]: === Iteration 689 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:53,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:53,102 INFO L82 PathProgramCache]: Analyzing trace with hash -150236975, now seen corresponding path program 682 times [2020-02-10 20:18:53,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:53,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890580959] [2020-02-10 20:18:53,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:53,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:53,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:53,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890580959] [2020-02-10 20:18:53,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:53,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:53,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970722319] [2020-02-10 20:18:53,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:53,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:53,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:53,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:53,529 INFO L87 Difference]: Start difference. First operand 808 states and 3171 transitions. Second operand 10 states. [2020-02-10 20:18:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:53,634 INFO L93 Difference]: Finished difference Result 1494 states and 5132 transitions. [2020-02-10 20:18:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:53,634 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:53,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:53,638 INFO L225 Difference]: With dead ends: 1494 [2020-02-10 20:18:53,638 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 20:18:53,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 20:18:53,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 801. [2020-02-10 20:18:53,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:18:53,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3151 transitions. [2020-02-10 20:18:53,661 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3151 transitions. Word has length 25 [2020-02-10 20:18:53,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:53,662 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3151 transitions. [2020-02-10 20:18:53,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:53,662 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3151 transitions. [2020-02-10 20:18:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:53,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:53,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:18:53,663 INFO L427 AbstractCegarLoop]: === Iteration 690 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:53,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:53,663 INFO L82 PathProgramCache]: Analyzing trace with hash 2016939993, now seen corresponding path program 683 times [2020-02-10 20:18:53,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:53,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1513592174] [2020-02-10 20:18:53,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:53,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1513592174] [2020-02-10 20:18:54,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:54,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308239858] [2020-02-10 20:18:54,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:54,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:54,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:54,098 INFO L87 Difference]: Start difference. First operand 801 states and 3151 transitions. Second operand 10 states. [2020-02-10 20:18:54,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,223 INFO L93 Difference]: Finished difference Result 1495 states and 5134 transitions. [2020-02-10 20:18:54,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:54,223 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:54,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,227 INFO L225 Difference]: With dead ends: 1495 [2020-02-10 20:18:54,227 INFO L226 Difference]: Without dead ends: 1479 [2020-02-10 20:18:54,227 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:54,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1479 states. [2020-02-10 20:18:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1479 to 810. [2020-02-10 20:18:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 810 states. [2020-02-10 20:18:54,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 810 states to 810 states and 3167 transitions. [2020-02-10 20:18:54,250 INFO L78 Accepts]: Start accepts. Automaton has 810 states and 3167 transitions. Word has length 25 [2020-02-10 20:18:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,250 INFO L479 AbstractCegarLoop]: Abstraction has 810 states and 3167 transitions. [2020-02-10 20:18:54,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 810 states and 3167 transitions. [2020-02-10 20:18:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:54,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,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, 1, 1, 1] [2020-02-10 20:18:54,251 INFO L427 AbstractCegarLoop]: === Iteration 691 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,251 INFO L82 PathProgramCache]: Analyzing trace with hash 943854613, now seen corresponding path program 684 times [2020-02-10 20:18:54,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242376992] [2020-02-10 20:18:54,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:54,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:54,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242376992] [2020-02-10 20:18:54,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:54,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:54,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103259859] [2020-02-10 20:18:54,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:54,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:54,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:54,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:54,678 INFO L87 Difference]: Start difference. First operand 810 states and 3167 transitions. Second operand 10 states. [2020-02-10 20:18:54,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:54,792 INFO L93 Difference]: Finished difference Result 1497 states and 5130 transitions. [2020-02-10 20:18:54,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:54,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:54,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:54,796 INFO L225 Difference]: With dead ends: 1497 [2020-02-10 20:18:54,796 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:18:54,796 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:18:54,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 792. [2020-02-10 20:18:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:54,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3127 transitions. [2020-02-10 20:18:54,821 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3127 transitions. Word has length 25 [2020-02-10 20:18:54,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:54,821 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3127 transitions. [2020-02-10 20:18:54,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:54,821 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3127 transitions. [2020-02-10 20:18:54,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:54,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:54,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, 1, 1, 1] [2020-02-10 20:18:54,822 INFO L427 AbstractCegarLoop]: === Iteration 692 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:54,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:54,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1227438421, now seen corresponding path program 685 times [2020-02-10 20:18:54,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:54,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942817185] [2020-02-10 20:18:54,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:54,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:55,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:55,231 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942817185] [2020-02-10 20:18:55,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:55,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:55,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707100975] [2020-02-10 20:18:55,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:55,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:55,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:55,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:55,232 INFO L87 Difference]: Start difference. First operand 792 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:18:55,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:55,362 INFO L93 Difference]: Finished difference Result 1476 states and 5098 transitions. [2020-02-10 20:18:55,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:55,363 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:55,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:55,367 INFO L225 Difference]: With dead ends: 1476 [2020-02-10 20:18:55,367 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:18:55,367 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:55,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:18:55,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 803. [2020-02-10 20:18:55,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2020-02-10 20:18:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 3158 transitions. [2020-02-10 20:18:55,390 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 3158 transitions. Word has length 25 [2020-02-10 20:18:55,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:55,390 INFO L479 AbstractCegarLoop]: Abstraction has 803 states and 3158 transitions. [2020-02-10 20:18:55,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:55,390 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 3158 transitions. [2020-02-10 20:18:55,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:55,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18: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, 1, 1, 1] [2020-02-10 20:18:55,391 INFO L427 AbstractCegarLoop]: === Iteration 693 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1765293999, now seen corresponding path program 686 times [2020-02-10 20:18:55,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:55,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924326341] [2020-02-10 20:18:55,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:55,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:55,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:55,802 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924326341] [2020-02-10 20:18:55,802 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:55,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:55,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254385640] [2020-02-10 20:18:55,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:55,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:55,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:55,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:55,803 INFO L87 Difference]: Start difference. First operand 803 states and 3158 transitions. Second operand 10 states. [2020-02-10 20:18:55,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:55,938 INFO L93 Difference]: Finished difference Result 1475 states and 5091 transitions. [2020-02-10 20:18:55,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:55,938 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:55,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:55,955 INFO L225 Difference]: With dead ends: 1475 [2020-02-10 20:18:55,955 INFO L226 Difference]: Without dead ends: 1456 [2020-02-10 20:18:55,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:55,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2020-02-10 20:18:55,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 798. [2020-02-10 20:18:55,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:55,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3144 transitions. [2020-02-10 20:18:55,976 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3144 transitions. Word has length 25 [2020-02-10 20:18:55,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:55,976 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3144 transitions. [2020-02-10 20:18:55,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:55,976 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3144 transitions. [2020-02-10 20:18:55,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:55,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:55,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, 1, 1, 1] [2020-02-10 20:18:55,978 INFO L427 AbstractCegarLoop]: === Iteration 694 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:55,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:55,978 INFO L82 PathProgramCache]: Analyzing trace with hash -372999433, now seen corresponding path program 687 times [2020-02-10 20:18:55,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:55,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105392512] [2020-02-10 20:18:55,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:55,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105392512] [2020-02-10 20:18:56,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:56,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940296745] [2020-02-10 20:18:56,391 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:56,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:56,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:56,391 INFO L87 Difference]: Start difference. First operand 798 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:18:56,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:56,519 INFO L93 Difference]: Finished difference Result 1482 states and 5105 transitions. [2020-02-10 20:18:56,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:56,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:56,523 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:18:56,523 INFO L226 Difference]: Without dead ends: 1467 [2020-02-10 20:18:56,524 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2020-02-10 20:18:56,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 805. [2020-02-10 20:18:56,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:18:56,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3157 transitions. [2020-02-10 20:18:56,546 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3157 transitions. Word has length 25 [2020-02-10 20:18:56,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:56,546 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3157 transitions. [2020-02-10 20:18:56,546 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:56,546 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3157 transitions. [2020-02-10 20:18:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:56,547 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:56,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, 1, 1, 1] [2020-02-10 20:18:56,547 INFO L427 AbstractCegarLoop]: === Iteration 695 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:56,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:56,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1775797103, now seen corresponding path program 688 times [2020-02-10 20:18:56,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:56,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195239077] [2020-02-10 20:18:56,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:56,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:56,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195239077] [2020-02-10 20:18:56,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:56,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:56,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698101714] [2020-02-10 20:18:56,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:56,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:56,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:56,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:56,963 INFO L87 Difference]: Start difference. First operand 805 states and 3157 transitions. Second operand 10 states. [2020-02-10 20:18:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,073 INFO L93 Difference]: Finished difference Result 1485 states and 5104 transitions. [2020-02-10 20:18:57,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:57,073 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,077 INFO L225 Difference]: With dead ends: 1485 [2020-02-10 20:18:57,077 INFO L226 Difference]: Without dead ends: 1460 [2020-02-10 20:18:57,077 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2020-02-10 20:18:57,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 798. [2020-02-10 20:18:57,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:18:57,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3138 transitions. [2020-02-10 20:18:57,100 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3138 transitions. Word has length 25 [2020-02-10 20:18:57,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,100 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3138 transitions. [2020-02-10 20:18:57,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:57,100 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3138 transitions. [2020-02-10 20:18:57,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:57,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,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, 1, 1, 1] [2020-02-10 20:18:57,101 INFO L427 AbstractCegarLoop]: === Iteration 696 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,101 INFO L82 PathProgramCache]: Analyzing trace with hash -341490121, now seen corresponding path program 689 times [2020-02-10 20:18:57,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454345127] [2020-02-10 20:18:57,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:57,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:57,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454345127] [2020-02-10 20:18:57,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:57,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:57,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361563640] [2020-02-10 20:18:57,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:57,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:57,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:57,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:57,512 INFO L87 Difference]: Start difference. First operand 798 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:18:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:57,641 INFO L93 Difference]: Finished difference Result 1479 states and 5092 transitions. [2020-02-10 20:18:57,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:57,642 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:57,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:57,645 INFO L225 Difference]: With dead ends: 1479 [2020-02-10 20:18:57,645 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:18:57,646 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:57,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:18:57,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 804. [2020-02-10 20:18:57,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:18:57,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3149 transitions. [2020-02-10 20:18:57,668 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3149 transitions. Word has length 25 [2020-02-10 20:18:57,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:57,668 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3149 transitions. [2020-02-10 20:18:57,668 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:57,669 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3149 transitions. [2020-02-10 20:18:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:57,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:57,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, 1, 1, 1] [2020-02-10 20:18:57,670 INFO L427 AbstractCegarLoop]: === Iteration 697 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:57,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:57,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1269450837, now seen corresponding path program 690 times [2020-02-10 20:18:57,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:57,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693403543] [2020-02-10 20:18:57,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:58,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693403543] [2020-02-10 20:18:58,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:58,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:58,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494433686] [2020-02-10 20:18:58,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:58,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:58,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:58,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:58,093 INFO L87 Difference]: Start difference. First operand 804 states and 3149 transitions. Second operand 10 states. [2020-02-10 20:18:58,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:58,197 INFO L93 Difference]: Finished difference Result 1483 states and 5094 transitions. [2020-02-10 20:18:58,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:58,197 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:58,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:58,201 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:18:58,201 INFO L226 Difference]: Without dead ends: 1453 [2020-02-10 20:18:58,202 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:58,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2020-02-10 20:18:58,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 792. [2020-02-10 20:18:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:18:58,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3121 transitions. [2020-02-10 20:18:58,224 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3121 transitions. Word has length 25 [2020-02-10 20:18:58,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,224 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3121 transitions. [2020-02-10 20:18:58,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:58,224 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3121 transitions. [2020-02-10 20:18:58,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:58,225 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,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, 1, 1, 1] [2020-02-10 20:18:58,225 INFO L427 AbstractCegarLoop]: === Iteration 698 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,226 INFO L82 PathProgramCache]: Analyzing trace with hash 805545489, now seen corresponding path program 691 times [2020-02-10 20:18:58,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105494204] [2020-02-10 20:18:58,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:18:58,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105494204] [2020-02-10 20:18:58,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:58,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:58,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303438335] [2020-02-10 20:18:58,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:58,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:58,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:58,628 INFO L87 Difference]: Start difference. First operand 792 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:18:58,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:58,778 INFO L93 Difference]: Finished difference Result 1482 states and 5104 transitions. [2020-02-10 20:18:58,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:58,779 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:58,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:58,783 INFO L225 Difference]: With dead ends: 1482 [2020-02-10 20:18:58,783 INFO L226 Difference]: Without dead ends: 1466 [2020-02-10 20:18:58,783 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:58,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2020-02-10 20:18:58,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 804. [2020-02-10 20:18:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:18:58,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3154 transitions. [2020-02-10 20:18:58,806 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3154 transitions. Word has length 25 [2020-02-10 20:18:58,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:58,806 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3154 transitions. [2020-02-10 20:18:58,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:58,806 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3154 transitions. [2020-02-10 20:18:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:58,807 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:58,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, 1, 1, 1] [2020-02-10 20:18:58,807 INFO L427 AbstractCegarLoop]: === Iteration 699 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:58,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:58,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1878480849, now seen corresponding path program 692 times [2020-02-10 20:18:58,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:58,807 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582559609] [2020-02-10 20:18:58,807 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18: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 20:18:59,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582559609] [2020-02-10 20:18:59,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:59,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218989407] [2020-02-10 20:18:59,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:59,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:59,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:59,211 INFO L87 Difference]: Start difference. First operand 804 states and 3154 transitions. Second operand 10 states. [2020-02-10 20:18:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,349 INFO L93 Difference]: Finished difference Result 1480 states and 5095 transitions. [2020-02-10 20:18:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:59,350 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:59,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,353 INFO L225 Difference]: With dead ends: 1480 [2020-02-10 20:18:59,354 INFO L226 Difference]: Without dead ends: 1461 [2020-02-10 20:18:59,354 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:59,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1461 states. [2020-02-10 20:18:59,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1461 to 799. [2020-02-10 20:18:59,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:18:59,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3140 transitions. [2020-02-10 20:18:59,376 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3140 transitions. Word has length 25 [2020-02-10 20:18:59,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,376 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3140 transitions. [2020-02-10 20:18:59,376 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:59,377 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3140 transitions. [2020-02-10 20:18:59,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:59,377 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,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, 1, 1, 1] [2020-02-10 20:18:59,378 INFO L427 AbstractCegarLoop]: === Iteration 700 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,378 INFO L82 PathProgramCache]: Analyzing trace with hash -794892365, now seen corresponding path program 693 times [2020-02-10 20:18:59,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:18:59,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133755061] [2020-02-10 20:18:59,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:18:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:18:59,806 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 26 [2020-02-10 20:18:59,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 20:18:59,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133755061] [2020-02-10 20:18:59,812 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:18:59,812 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:18:59,812 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227909380] [2020-02-10 20:18:59,812 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:18:59,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:18:59,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:18:59,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:18:59,812 INFO L87 Difference]: Start difference. First operand 799 states and 3140 transitions. Second operand 10 states. [2020-02-10 20:18:59,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:18:59,971 INFO L93 Difference]: Finished difference Result 1490 states and 5115 transitions. [2020-02-10 20:18:59,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:18:59,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:18:59,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:18:59,975 INFO L225 Difference]: With dead ends: 1490 [2020-02-10 20:18:59,975 INFO L226 Difference]: Without dead ends: 1474 [2020-02-10 20:18:59,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:18:59,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1474 states. [2020-02-10 20:18:59,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1474 to 808. [2020-02-10 20:18:59,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2020-02-10 20:18:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 3156 transitions. [2020-02-10 20:18:59,998 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 3156 transitions. Word has length 25 [2020-02-10 20:18:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:18:59,998 INFO L479 AbstractCegarLoop]: Abstraction has 808 states and 3156 transitions. [2020-02-10 20:18:59,998 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:18:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 3156 transitions. [2020-02-10 20:18:59,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:18:59,999 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:18:59,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, 1, 1, 1] [2020-02-10 20:18:59,999 INFO L427 AbstractCegarLoop]: === Iteration 701 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:18:59,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:18:59,999 INFO L82 PathProgramCache]: Analyzing trace with hash -1867977745, now seen corresponding path program 694 times [2020-02-10 20:18:59,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:00,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20185442] [2020-02-10 20:19:00,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:00,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20185442] [2020-02-10 20:19:00,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:00,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449507334] [2020-02-10 20:19:00,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:00,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:00,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:00,420 INFO L87 Difference]: Start difference. First operand 808 states and 3156 transitions. Second operand 10 states. [2020-02-10 20:19:00,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:00,529 INFO L93 Difference]: Finished difference Result 1492 states and 5111 transitions. [2020-02-10 20:19:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:00,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:00,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:00,533 INFO L225 Difference]: With dead ends: 1492 [2020-02-10 20:19:00,533 INFO L226 Difference]: Without dead ends: 1465 [2020-02-10 20:19:00,533 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2020-02-10 20:19:00,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 799. [2020-02-10 20:19:00,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 799 states. [2020-02-10 20:19:00,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 3133 transitions. [2020-02-10 20:19:00,556 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 3133 transitions. Word has length 25 [2020-02-10 20:19:00,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:00,556 INFO L479 AbstractCegarLoop]: Abstraction has 799 states and 3133 transitions. [2020-02-10 20:19:00,556 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:00,556 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 3133 transitions. [2020-02-10 20:19:00,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:00,557 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:00,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, 1, 1, 1] [2020-02-10 20:19:00,557 INFO L427 AbstractCegarLoop]: === Iteration 702 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:00,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:00,558 INFO L82 PathProgramCache]: Analyzing trace with hash -784389261, now seen corresponding path program 695 times [2020-02-10 20:19:00,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:00,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913689249] [2020-02-10 20:19:00,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:00,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:00,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913689249] [2020-02-10 20:19:00,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:00,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:00,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094244043] [2020-02-10 20:19:00,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:00,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:00,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:00,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:00,965 INFO L87 Difference]: Start difference. First operand 799 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:19:01,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,098 INFO L93 Difference]: Finished difference Result 1483 states and 5093 transitions. [2020-02-10 20:19:01,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:01,098 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:01,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,102 INFO L225 Difference]: With dead ends: 1483 [2020-02-10 20:19:01,102 INFO L226 Difference]: Without dead ends: 1469 [2020-02-10 20:19:01,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2020-02-10 20:19:01,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 805. [2020-02-10 20:19:01,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2020-02-10 20:19:01,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 3144 transitions. [2020-02-10 20:19:01,125 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 3144 transitions. Word has length 25 [2020-02-10 20:19:01,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,126 INFO L479 AbstractCegarLoop]: Abstraction has 805 states and 3144 transitions. [2020-02-10 20:19:01,126 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:01,126 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 3144 transitions. [2020-02-10 20:19:01,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:01,127 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,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, 1, 1, 1] [2020-02-10 20:19:01,127 INFO L427 AbstractCegarLoop]: === Iteration 703 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,128 INFO L82 PathProgramCache]: Analyzing trace with hash 826551697, now seen corresponding path program 696 times [2020-02-10 20:19:01,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102805329] [2020-02-10 20:19:01,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:01,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:01,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102805329] [2020-02-10 20:19:01,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:01,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:01,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981926980] [2020-02-10 20:19:01,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:01,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:01,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:01,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:01,542 INFO L87 Difference]: Start difference. First operand 805 states and 3144 transitions. Second operand 10 states. [2020-02-10 20:19:01,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:01,651 INFO L93 Difference]: Finished difference Result 1487 states and 5095 transitions. [2020-02-10 20:19:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:01,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:01,655 INFO L225 Difference]: With dead ends: 1487 [2020-02-10 20:19:01,655 INFO L226 Difference]: Without dead ends: 1447 [2020-02-10 20:19:01,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2020-02-10 20:19:01,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 783. [2020-02-10 20:19:01,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3099 transitions. [2020-02-10 20:19:01,678 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3099 transitions. Word has length 25 [2020-02-10 20:19:01,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:01,678 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3099 transitions. [2020-02-10 20:19:01,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:01,678 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3099 transitions. [2020-02-10 20:19:01,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:01,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:01,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, 1, 1, 1] [2020-02-10 20:19:01,679 INFO L427 AbstractCegarLoop]: === Iteration 704 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:01,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:01,679 INFO L82 PathProgramCache]: Analyzing trace with hash 489859575, now seen corresponding path program 697 times [2020-02-10 20:19:01,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:01,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241384263] [2020-02-10 20:19:01,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:01,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241384263] [2020-02-10 20:19:02,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:02,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093249587] [2020-02-10 20:19:02,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:02,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:02,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:02,076 INFO L87 Difference]: Start difference. First operand 783 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:19:02,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,214 INFO L93 Difference]: Finished difference Result 1432 states and 4979 transitions. [2020-02-10 20:19:02,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:02,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:02,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,219 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:19:02,219 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:19:02,219 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:02,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:19:02,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 794. [2020-02-10 20:19:02,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:19:02,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3136 transitions. [2020-02-10 20:19:02,242 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3136 transitions. Word has length 25 [2020-02-10 20:19:02,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,242 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3136 transitions. [2020-02-10 20:19:02,242 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:02,242 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3136 transitions. [2020-02-10 20:19:02,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:02,243 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,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, 1, 1, 1] [2020-02-10 20:19:02,243 INFO L427 AbstractCegarLoop]: === Iteration 705 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2100800533, now seen corresponding path program 698 times [2020-02-10 20:19:02,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012612285] [2020-02-10 20:19:02,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:02,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012612285] [2020-02-10 20:19:02,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:02,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:02,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314050500] [2020-02-10 20:19:02,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:02,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:02,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:02,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:02,615 INFO L87 Difference]: Start difference. First operand 794 states and 3136 transitions. Second operand 10 states. [2020-02-10 20:19:02,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:02,750 INFO L93 Difference]: Finished difference Result 1436 states and 4984 transitions. [2020-02-10 20:19:02,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:02,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:02,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:02,754 INFO L225 Difference]: With dead ends: 1436 [2020-02-10 20:19:02,755 INFO L226 Difference]: Without dead ends: 1417 [2020-02-10 20:19:02,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:02,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2020-02-10 20:19:02,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 791. [2020-02-10 20:19:02,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:19:02,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3128 transitions. [2020-02-10 20:19:02,777 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3128 transitions. Word has length 25 [2020-02-10 20:19:02,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:02,778 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3128 transitions. [2020-02-10 20:19:02,778 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:02,778 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3128 transitions. [2020-02-10 20:19:02,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:02,779 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:02,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, 1, 1, 1] [2020-02-10 20:19:02,779 INFO L427 AbstractCegarLoop]: === Iteration 706 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:02,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:02,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1110578279, now seen corresponding path program 699 times [2020-02-10 20:19:02,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:02,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297868104] [2020-02-10 20:19:02,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:03,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297868104] [2020-02-10 20:19:03,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:03,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101813299] [2020-02-10 20:19:03,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:03,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:03,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:03,165 INFO L87 Difference]: Start difference. First operand 791 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:19:03,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:03,311 INFO L93 Difference]: Finished difference Result 1430 states and 4972 transitions. [2020-02-10 20:19:03,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:03,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:03,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:03,314 INFO L225 Difference]: With dead ends: 1430 [2020-02-10 20:19:03,314 INFO L226 Difference]: Without dead ends: 1418 [2020-02-10 20:19:03,315 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:03,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1418 states. [2020-02-10 20:19:03,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1418 to 794. [2020-02-10 20:19:03,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 794 states. [2020-02-10 20:19:03,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 3133 transitions. [2020-02-10 20:19:03,337 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 3133 transitions. Word has length 25 [2020-02-10 20:19:03,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:03,337 INFO L479 AbstractCegarLoop]: Abstraction has 794 states and 3133 transitions. [2020-02-10 20:19:03,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:03,337 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 3133 transitions. [2020-02-10 20:19:03,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:03,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:03,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:03,338 INFO L427 AbstractCegarLoop]: === Iteration 707 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:03,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2111303637, now seen corresponding path program 700 times [2020-02-10 20:19:03,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:03,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031747837] [2020-02-10 20:19:03,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:03,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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 20:19:03,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031747837] [2020-02-10 20:19:03,723 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:03,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:03,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241828147] [2020-02-10 20:19:03,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:03,724 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:03,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:03,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:03,724 INFO L87 Difference]: Start difference. First operand 794 states and 3133 transitions. Second operand 10 states. [2020-02-10 20:19:03,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:03,873 INFO L93 Difference]: Finished difference Result 1432 states and 4973 transitions. [2020-02-10 20:19:03,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:03,873 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:03,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:03,877 INFO L225 Difference]: With dead ends: 1432 [2020-02-10 20:19:03,877 INFO L226 Difference]: Without dead ends: 1415 [2020-02-10 20:19:03,877 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-02-10 20:19:03,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 791. [2020-02-10 20:19:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2020-02-10 20:19:03,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 3125 transitions. [2020-02-10 20:19:03,899 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 3125 transitions. Word has length 25 [2020-02-10 20:19:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:03,900 INFO L479 AbstractCegarLoop]: Abstraction has 791 states and 3125 transitions. [2020-02-10 20:19:03,900 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:03,900 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 3125 transitions. [2020-02-10 20:19:03,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:03,901 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:03,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, 1, 1, 1] [2020-02-10 20:19:03,901 INFO L427 AbstractCegarLoop]: === Iteration 708 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:03,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1100075175, now seen corresponding path program 701 times [2020-02-10 20:19:03,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:03,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382165967] [2020-02-10 20:19:03,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:03,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:04,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:04,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382165967] [2020-02-10 20:19:04,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:04,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:04,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907562083] [2020-02-10 20:19:04,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:04,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:04,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:04,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:04,286 INFO L87 Difference]: Start difference. First operand 791 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:19:04,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,420 INFO L93 Difference]: Finished difference Result 1440 states and 4991 transitions. [2020-02-10 20:19:04,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:04,420 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:04,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:04,424 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:19:04,424 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:19:04,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:19:04,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 796. [2020-02-10 20:19:04,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:19:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3134 transitions. [2020-02-10 20:19:04,447 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3134 transitions. Word has length 25 [2020-02-10 20:19:04,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:04,447 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3134 transitions. [2020-02-10 20:19:04,447 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:04,447 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3134 transitions. [2020-02-10 20:19:04,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:04,448 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:04,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, 1, 1, 1] [2020-02-10 20:19:04,448 INFO L427 AbstractCegarLoop]: === Iteration 709 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:04,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:04,449 INFO L82 PathProgramCache]: Analyzing trace with hash 510865783, now seen corresponding path program 702 times [2020-02-10 20:19:04,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:04,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914640824] [2020-02-10 20:19:04,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:04,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:04,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914640824] [2020-02-10 20:19:04,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:04,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:04,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325801359] [2020-02-10 20:19:04,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:04,838 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:04,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:04,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:04,838 INFO L87 Difference]: Start difference. First operand 796 states and 3134 transitions. Second operand 10 states. [2020-02-10 20:19:04,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:04,999 INFO L93 Difference]: Finished difference Result 1438 states and 4982 transitions. [2020-02-10 20:19:04,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:05,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:05,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:05,004 INFO L225 Difference]: With dead ends: 1438 [2020-02-10 20:19:05,004 INFO L226 Difference]: Without dead ends: 1416 [2020-02-10 20:19:05,004 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:05,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1416 states. [2020-02-10 20:19:05,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1416 to 788. [2020-02-10 20:19:05,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:19:05,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3117 transitions. [2020-02-10 20:19:05,029 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3117 transitions. Word has length 25 [2020-02-10 20:19:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:05,029 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3117 transitions. [2020-02-10 20:19:05,029 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:05,029 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3117 transitions. [2020-02-10 20:19:05,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:05,030 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:05,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, 1, 1, 1] [2020-02-10 20:19:05,030 INFO L427 AbstractCegarLoop]: === Iteration 710 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:05,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1879073643, now seen corresponding path program 703 times [2020-02-10 20:19:05,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:05,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862941388] [2020-02-10 20:19:05,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:05,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:05,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862941388] [2020-02-10 20:19:05,414 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:05,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:05,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515748640] [2020-02-10 20:19:05,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:05,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:05,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:05,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:05,415 INFO L87 Difference]: Start difference. First operand 788 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:19:05,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:05,577 INFO L93 Difference]: Finished difference Result 1443 states and 4999 transitions. [2020-02-10 20:19:05,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:05,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:05,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:05,580 INFO L225 Difference]: With dead ends: 1443 [2020-02-10 20:19:05,580 INFO L226 Difference]: Without dead ends: 1431 [2020-02-10 20:19:05,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:05,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2020-02-10 20:19:05,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 796. [2020-02-10 20:19:05,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:19:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3138 transitions. [2020-02-10 20:19:05,603 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3138 transitions. Word has length 25 [2020-02-10 20:19:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:05,603 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3138 transitions. [2020-02-10 20:19:05,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:05,603 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3138 transitions. [2020-02-10 20:19:05,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:05,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19: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, 1, 1, 1] [2020-02-10 20:19:05,604 INFO L427 AbstractCegarLoop]: === Iteration 711 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:05,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:05,604 INFO L82 PathProgramCache]: Analyzing trace with hash -268132685, now seen corresponding path program 704 times [2020-02-10 20:19:05,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:05,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078076268] [2020-02-10 20:19:05,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:06,001 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:06,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078076268] [2020-02-10 20:19:06,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:06,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:06,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652113283] [2020-02-10 20:19:06,002 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:06,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:06,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:06,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:06,002 INFO L87 Difference]: Start difference. First operand 796 states and 3138 transitions. Second operand 10 states. [2020-02-10 20:19:06,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,140 INFO L93 Difference]: Finished difference Result 1447 states and 5004 transitions. [2020-02-10 20:19:06,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:06,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:06,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,145 INFO L225 Difference]: With dead ends: 1447 [2020-02-10 20:19:06,145 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:19:06,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:06,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:19:06,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 793. [2020-02-10 20:19:06,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:19:06,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3130 transitions. [2020-02-10 20:19:06,167 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3130 transitions. Word has length 25 [2020-02-10 20:19:06,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,167 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3130 transitions. [2020-02-10 20:19:06,168 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:06,168 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3130 transitions. [2020-02-10 20:19:06,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:06,169 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:06,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, 1, 1, 1] [2020-02-10 20:19:06,169 INFO L427 AbstractCegarLoop]: === Iteration 712 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,169 INFO L82 PathProgramCache]: Analyzing trace with hash -784982055, now seen corresponding path program 705 times [2020-02-10 20:19:06,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253315918] [2020-02-10 20:19:06,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:06,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253315918] [2020-02-10 20:19:06,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:06,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:06,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294368990] [2020-02-10 20:19:06,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:06,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:06,557 INFO L87 Difference]: Start difference. First operand 793 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:19:06,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:06,695 INFO L93 Difference]: Finished difference Result 1446 states and 5001 transitions. [2020-02-10 20:19:06,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:06,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:06,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:06,699 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:19:06,699 INFO L226 Difference]: Without dead ends: 1434 [2020-02-10 20:19:06,700 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:06,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1434 states. [2020-02-10 20:19:06,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1434 to 797. [2020-02-10 20:19:06,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2020-02-10 20:19:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 3137 transitions. [2020-02-10 20:19:06,722 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 3137 transitions. Word has length 25 [2020-02-10 20:19:06,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:06,722 INFO L479 AbstractCegarLoop]: Abstraction has 797 states and 3137 transitions. [2020-02-10 20:19:06,722 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:06,723 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 3137 transitions. [2020-02-10 20:19:06,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:06,723 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:06,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:06,724 INFO L427 AbstractCegarLoop]: === Iteration 713 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:06,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:06,724 INFO L82 PathProgramCache]: Analyzing trace with hash -247126477, now seen corresponding path program 706 times [2020-02-10 20:19:06,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:06,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578786650] [2020-02-10 20:19:06,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,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 20:19:07,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578786650] [2020-02-10 20:19:07,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:07,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817869185] [2020-02-10 20:19:07,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:07,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:07,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:07,114 INFO L87 Difference]: Start difference. First operand 797 states and 3137 transitions. Second operand 10 states. [2020-02-10 20:19:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,224 INFO L93 Difference]: Finished difference Result 1452 states and 5009 transitions. [2020-02-10 20:19:07,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:07,224 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,228 INFO L225 Difference]: With dead ends: 1452 [2020-02-10 20:19:07,228 INFO L226 Difference]: Without dead ends: 1430 [2020-02-10 20:19:07,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:07,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2020-02-10 20:19:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 793. [2020-02-10 20:19:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793 states. [2020-02-10 20:19:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793 states to 793 states and 3126 transitions. [2020-02-10 20:19:07,253 INFO L78 Accepts]: Start accepts. Automaton has 793 states and 3126 transitions. Word has length 25 [2020-02-10 20:19:07,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,253 INFO L479 AbstractCegarLoop]: Abstraction has 793 states and 3126 transitions. [2020-02-10 20:19:07,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:07,253 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 3126 transitions. [2020-02-10 20:19:07,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:07,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,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, 1, 1, 1] [2020-02-10 20:19:07,254 INFO L427 AbstractCegarLoop]: === Iteration 714 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,254 INFO L82 PathProgramCache]: Analyzing trace with hash -774478951, now seen corresponding path program 707 times [2020-02-10 20:19:07,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642112026] [2020-02-10 20:19:07,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:07,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:07,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642112026] [2020-02-10 20:19:07,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:07,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:07,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734161347] [2020-02-10 20:19:07,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:07,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:07,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:07,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:07,653 INFO L87 Difference]: Start difference. First operand 793 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:19:07,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:07,798 INFO L93 Difference]: Finished difference Result 1459 states and 5026 transitions. [2020-02-10 20:19:07,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:07,799 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:07,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:07,802 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:19:07,803 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:19:07,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:19:07,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 802. [2020-02-10 20:19:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 802 states. [2020-02-10 20:19:07,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 3142 transitions. [2020-02-10 20:19:07,825 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 3142 transitions. Word has length 25 [2020-02-10 20:19:07,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:07,825 INFO L479 AbstractCegarLoop]: Abstraction has 802 states and 3142 transitions. [2020-02-10 20:19:07,825 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:07,825 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 3142 transitions. [2020-02-10 20:19:07,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:07,826 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:07,827 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:07,827 INFO L427 AbstractCegarLoop]: === Iteration 715 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:07,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:07,827 INFO L82 PathProgramCache]: Analyzing trace with hash -1847564331, now seen corresponding path program 708 times [2020-02-10 20:19:07,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:07,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890685250] [2020-02-10 20:19:07,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:07,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890685250] [2020-02-10 20:19:08,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:08,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037946368] [2020-02-10 20:19:08,242 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:08,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:08,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:08,243 INFO L87 Difference]: Start difference. First operand 802 states and 3142 transitions. Second operand 10 states. [2020-02-10 20:19:08,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,358 INFO L93 Difference]: Finished difference Result 1461 states and 5022 transitions. [2020-02-10 20:19:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:08,358 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:08,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,362 INFO L225 Difference]: With dead ends: 1461 [2020-02-10 20:19:08,362 INFO L226 Difference]: Without dead ends: 1429 [2020-02-10 20:19:08,362 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:08,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1429 states. [2020-02-10 20:19:08,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1429 to 788. [2020-02-10 20:19:08,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:19:08,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3112 transitions. [2020-02-10 20:19:08,384 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3112 transitions. Word has length 25 [2020-02-10 20:19:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,384 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3112 transitions. [2020-02-10 20:19:08,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:08,384 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3112 transitions. [2020-02-10 20:19:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:08,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:08,385 INFO L427 AbstractCegarLoop]: === Iteration 716 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1553477419, now seen corresponding path program 709 times [2020-02-10 20:19:08,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997329689] [2020-02-10 20:19:08,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:08,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:08,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997329689] [2020-02-10 20:19:08,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:08,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:08,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363346260] [2020-02-10 20:19:08,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:08,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:08,783 INFO L87 Difference]: Start difference. First operand 788 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:19:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:08,942 INFO L93 Difference]: Finished difference Result 1435 states and 4977 transitions. [2020-02-10 20:19:08,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:08,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:08,946 INFO L225 Difference]: With dead ends: 1435 [2020-02-10 20:19:08,946 INFO L226 Difference]: Without dead ends: 1423 [2020-02-10 20:19:08,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:08,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1423 states. [2020-02-10 20:19:08,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1423 to 795. [2020-02-10 20:19:08,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:19:08,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3131 transitions. [2020-02-10 20:19:08,969 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3131 transitions. Word has length 25 [2020-02-10 20:19:08,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:08,969 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3131 transitions. [2020-02-10 20:19:08,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3131 transitions. [2020-02-10 20:19:08,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:08,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:08,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, 1, 1, 1] [2020-02-10 20:19:08,971 INFO L427 AbstractCegarLoop]: === Iteration 717 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:08,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:08,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1668404497, now seen corresponding path program 710 times [2020-02-10 20:19:08,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:08,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373561037] [2020-02-10 20:19:08,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:09,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:09,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373561037] [2020-02-10 20:19:09,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:09,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:09,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814400030] [2020-02-10 20:19:09,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:09,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:09,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:09,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:09,360 INFO L87 Difference]: Start difference. First operand 795 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:19:09,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:09,504 INFO L93 Difference]: Finished difference Result 1437 states and 4978 transitions. [2020-02-10 20:19:09,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:09,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:09,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:09,508 INFO L225 Difference]: With dead ends: 1437 [2020-02-10 20:19:09,508 INFO L226 Difference]: Without dead ends: 1420 [2020-02-10 20:19:09,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:09,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1420 states. [2020-02-10 20:19:09,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1420 to 792. [2020-02-10 20:19:09,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:19:09,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3123 transitions. [2020-02-10 20:19:09,531 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3123 transitions. Word has length 25 [2020-02-10 20:19:09,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:09,532 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3123 transitions. [2020-02-10 20:19:09,532 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:09,532 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3123 transitions. [2020-02-10 20:19:09,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:09,533 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:09,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, 1, 1, 1] [2020-02-10 20:19:09,533 INFO L427 AbstractCegarLoop]: === Iteration 718 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:09,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:09,533 INFO L82 PathProgramCache]: Analyzing trace with hash 1141052023, now seen corresponding path program 711 times [2020-02-10 20:19:09,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:09,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956695381] [2020-02-10 20:19:09,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:09,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:09,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956695381] [2020-02-10 20:19:09,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:09,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:09,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928521786] [2020-02-10 20:19:09,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:09,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:09,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:09,920 INFO L87 Difference]: Start difference. First operand 792 states and 3123 transitions. Second operand 10 states. [2020-02-10 20:19:10,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:10,059 INFO L93 Difference]: Finished difference Result 1440 states and 4983 transitions. [2020-02-10 20:19:10,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:10,059 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:10,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:10,063 INFO L225 Difference]: With dead ends: 1440 [2020-02-10 20:19:10,063 INFO L226 Difference]: Without dead ends: 1428 [2020-02-10 20:19:10,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2020-02-10 20:19:10,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 796. [2020-02-10 20:19:10,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2020-02-10 20:19:10,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 3130 transitions. [2020-02-10 20:19:10,085 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 3130 transitions. Word has length 25 [2020-02-10 20:19:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:10,085 INFO L479 AbstractCegarLoop]: Abstraction has 796 states and 3130 transitions. [2020-02-10 20:19:10,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:10,085 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 3130 transitions. [2020-02-10 20:19:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:10,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19: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, 1, 1, 1] [2020-02-10 20:19:10,087 INFO L427 AbstractCegarLoop]: === Iteration 719 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:10,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1678907601, now seen corresponding path program 712 times [2020-02-10 20:19:10,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:10,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601161185] [2020-02-10 20:19:10,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:10,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601161185] [2020-02-10 20:19:10,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:10,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:10,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410273725] [2020-02-10 20:19:10,496 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:10,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:10,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:10,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:10,496 INFO L87 Difference]: Start difference. First operand 796 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:19:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:10,606 INFO L93 Difference]: Finished difference Result 1446 states and 4991 transitions. [2020-02-10 20:19:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:10,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:10,610 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:19:10,610 INFO L226 Difference]: Without dead ends: 1424 [2020-02-10 20:19:10,610 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:10,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-02-10 20:19:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 792. [2020-02-10 20:19:10,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 792 states. [2020-02-10 20:19:10,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 3119 transitions. [2020-02-10 20:19:10,632 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:10,632 INFO L479 AbstractCegarLoop]: Abstraction has 792 states and 3119 transitions. [2020-02-10 20:19:10,632 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:10,632 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 3119 transitions. [2020-02-10 20:19:10,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:10,633 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:10,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, 1, 1, 1] [2020-02-10 20:19:10,634 INFO L427 AbstractCegarLoop]: === Iteration 720 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:10,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:10,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1162058231, now seen corresponding path program 713 times [2020-02-10 20:19:10,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:10,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157196004] [2020-02-10 20:19:10,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157196004] [2020-02-10 20:19:11,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:11,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47018258] [2020-02-10 20:19:11,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:11,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:11,029 INFO L87 Difference]: Start difference. First operand 792 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,168 INFO L93 Difference]: Finished difference Result 1446 states and 4993 transitions. [2020-02-10 20:19:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:11,168 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:11,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,172 INFO L225 Difference]: With dead ends: 1446 [2020-02-10 20:19:11,172 INFO L226 Difference]: Without dead ends: 1432 [2020-02-10 20:19:11,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:11,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1432 states. [2020-02-10 20:19:11,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1432 to 798. [2020-02-10 20:19:11,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 798 states. [2020-02-10 20:19:11,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 3130 transitions. [2020-02-10 20:19:11,194 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 3130 transitions. Word has length 25 [2020-02-10 20:19:11,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,194 INFO L479 AbstractCegarLoop]: Abstraction has 798 states and 3130 transitions. [2020-02-10 20:19:11,194 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:11,194 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 3130 transitions. [2020-02-10 20:19:11,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:11,195 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:11,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, 1, 1, 1] [2020-02-10 20:19:11,196 INFO L427 AbstractCegarLoop]: === Iteration 721 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1521968107, now seen corresponding path program 714 times [2020-02-10 20:19:11,196 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,196 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137947455] [2020-02-10 20:19:11,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:11,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:11,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137947455] [2020-02-10 20:19:11,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:11,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:11,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263949813] [2020-02-10 20:19:11,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:11,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:11,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:11,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:11,597 INFO L87 Difference]: Start difference. First operand 798 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:19:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:11,710 INFO L93 Difference]: Finished difference Result 1450 states and 4995 transitions. [2020-02-10 20:19:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:11,710 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:11,714 INFO L225 Difference]: With dead ends: 1450 [2020-02-10 20:19:11,714 INFO L226 Difference]: Without dead ends: 1422 [2020-02-10 20:19:11,714 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:11,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1422 states. [2020-02-10 20:19:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1422 to 788. [2020-02-10 20:19:11,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 788 states. [2020-02-10 20:19:11,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 788 states to 788 states and 3108 transitions. [2020-02-10 20:19:11,736 INFO L78 Accepts]: Start accepts. Automaton has 788 states and 3108 transitions. Word has length 25 [2020-02-10 20:19:11,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:11,736 INFO L479 AbstractCegarLoop]: Abstraction has 788 states and 3108 transitions. [2020-02-10 20:19:11,736 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:11,736 INFO L276 IsEmpty]: Start isEmpty. Operand 788 states and 3108 transitions. [2020-02-10 20:19:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:11,737 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19: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, 1, 1, 1] [2020-02-10 20:19:11,737 INFO L427 AbstractCegarLoop]: === Iteration 722 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 383059763, now seen corresponding path program 715 times [2020-02-10 20:19:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:11,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708087943] [2020-02-10 20:19:11,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708087943] [2020-02-10 20:19:12,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:12,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527927968] [2020-02-10 20:19:12,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:12,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:12,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:12,129 INFO L87 Difference]: Start difference. First operand 788 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:19:12,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:12,264 INFO L93 Difference]: Finished difference Result 1459 states and 5032 transitions. [2020-02-10 20:19:12,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:12,264 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:12,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:12,268 INFO L225 Difference]: With dead ends: 1459 [2020-02-10 20:19:12,268 INFO L226 Difference]: Without dead ends: 1443 [2020-02-10 20:19:12,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:12,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1443 states. [2020-02-10 20:19:12,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1443 to 800. [2020-02-10 20:19:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2020-02-10 20:19:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 3141 transitions. [2020-02-10 20:19:12,290 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 3141 transitions. Word has length 25 [2020-02-10 20:19:12,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:12,290 INFO L479 AbstractCegarLoop]: Abstraction has 800 states and 3141 transitions. [2020-02-10 20:19:12,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 3141 transitions. [2020-02-10 20:19:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:12,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:12,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, 1, 1, 1] [2020-02-10 20:19:12,291 INFO L427 AbstractCegarLoop]: === Iteration 723 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:12,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:12,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1994000721, now seen corresponding path program 716 times [2020-02-10 20:19:12,292 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:12,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460400798] [2020-02-10 20:19:12,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:12,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:12,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460400798] [2020-02-10 20:19:12,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:12,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:12,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636432779] [2020-02-10 20:19:12,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:12,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:12,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:12,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:12,700 INFO L87 Difference]: Start difference. First operand 800 states and 3141 transitions. Second operand 10 states. [2020-02-10 20:19:12,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:12,836 INFO L93 Difference]: Finished difference Result 1457 states and 5023 transitions. [2020-02-10 20:19:12,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:12,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:12,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:12,840 INFO L225 Difference]: With dead ends: 1457 [2020-02-10 20:19:12,840 INFO L226 Difference]: Without dead ends: 1438 [2020-02-10 20:19:12,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:12,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1438 states. [2020-02-10 20:19:12,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1438 to 795. [2020-02-10 20:19:12,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:19:12,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3127 transitions. [2020-02-10 20:19:12,862 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3127 transitions. Word has length 25 [2020-02-10 20:19:12,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:12,862 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3127 transitions. [2020-02-10 20:19:12,863 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:12,863 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3127 transitions. [2020-02-10 20:19:12,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:12,864 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:12,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, 1, 1, 1] [2020-02-10 20:19:12,864 INFO L427 AbstractCegarLoop]: === Iteration 724 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:12,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:12,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1217378091, now seen corresponding path program 717 times [2020-02-10 20:19:12,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:12,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077239612] [2020-02-10 20:19:12,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:13,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077239612] [2020-02-10 20:19:13,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:13,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:13,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606849785] [2020-02-10 20:19:13,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:13,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:13,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:13,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:13,296 INFO L87 Difference]: Start difference. First operand 795 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:19:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,436 INFO L93 Difference]: Finished difference Result 1467 states and 5043 transitions. [2020-02-10 20:19:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:13,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:13,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,440 INFO L225 Difference]: With dead ends: 1467 [2020-02-10 20:19:13,440 INFO L226 Difference]: Without dead ends: 1451 [2020-02-10 20:19:13,440 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:13,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1451 states. [2020-02-10 20:19:13,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1451 to 804. [2020-02-10 20:19:13,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 804 states. [2020-02-10 20:19:13,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 3143 transitions. [2020-02-10 20:19:13,462 INFO L78 Accepts]: Start accepts. Automaton has 804 states and 3143 transitions. Word has length 25 [2020-02-10 20:19:13,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:13,463 INFO L479 AbstractCegarLoop]: Abstraction has 804 states and 3143 transitions. [2020-02-10 20:19:13,463 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:13,463 INFO L276 IsEmpty]: Start isEmpty. Operand 804 states and 3143 transitions. [2020-02-10 20:19:13,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:13,464 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:13,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, 1, 1, 1] [2020-02-10 20:19:13,464 INFO L427 AbstractCegarLoop]: === Iteration 725 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:13,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:13,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2004503825, now seen corresponding path program 718 times [2020-02-10 20:19:13,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:13,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20718542] [2020-02-10 20:19:13,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:13,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:13,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 20:19:13,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20718542] [2020-02-10 20:19:13,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:13,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:13,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1491960958] [2020-02-10 20:19:13,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:13,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:13,875 INFO L87 Difference]: Start difference. First operand 804 states and 3143 transitions. Second operand 10 states. [2020-02-10 20:19:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:13,989 INFO L93 Difference]: Finished difference Result 1469 states and 5039 transitions. [2020-02-10 20:19:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:13,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:13,993 INFO L225 Difference]: With dead ends: 1469 [2020-02-10 20:19:13,993 INFO L226 Difference]: Without dead ends: 1442 [2020-02-10 20:19:13,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1442 states. [2020-02-10 20:19:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1442 to 795. [2020-02-10 20:19:14,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 795 states. [2020-02-10 20:19:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 795 states to 795 states and 3120 transitions. [2020-02-10 20:19:14,016 INFO L78 Accepts]: Start accepts. Automaton has 795 states and 3120 transitions. Word has length 25 [2020-02-10 20:19:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:14,016 INFO L479 AbstractCegarLoop]: Abstraction has 795 states and 3120 transitions. [2020-02-10 20:19:14,016 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:14,016 INFO L276 IsEmpty]: Start isEmpty. Operand 795 states and 3120 transitions. [2020-02-10 20:19:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:14,017 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:14,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, 1, 1, 1] [2020-02-10 20:19:14,017 INFO L427 AbstractCegarLoop]: === Iteration 726 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:14,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:14,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1206874987, now seen corresponding path program 719 times [2020-02-10 20:19:14,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:14,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438335750] [2020-02-10 20:19:14,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:14,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:14,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438335750] [2020-02-10 20:19:14,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:14,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:14,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490255996] [2020-02-10 20:19:14,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:14,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:14,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:14,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:14,419 INFO L87 Difference]: Start difference. First operand 795 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:19:14,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:14,556 INFO L93 Difference]: Finished difference Result 1460 states and 5021 transitions. [2020-02-10 20:19:14,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:14,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:14,560 INFO L225 Difference]: With dead ends: 1460 [2020-02-10 20:19:14,560 INFO L226 Difference]: Without dead ends: 1446 [2020-02-10 20:19:14,561 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:14,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1446 states. [2020-02-10 20:19:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1446 to 801. [2020-02-10 20:19:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 801 states. [2020-02-10 20:19:14,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 3131 transitions. [2020-02-10 20:19:14,583 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 3131 transitions. Word has length 25 [2020-02-10 20:19:14,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:14,583 INFO L479 AbstractCegarLoop]: Abstraction has 801 states and 3131 transitions. [2020-02-10 20:19:14,583 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 3131 transitions. [2020-02-10 20:19:14,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:14,584 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:14,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, 1, 1, 1] [2020-02-10 20:19:14,584 INFO L427 AbstractCegarLoop]: === Iteration 727 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:14,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:14,584 INFO L82 PathProgramCache]: Analyzing trace with hash 404065971, now seen corresponding path program 720 times [2020-02-10 20:19:14,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:14,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328109523] [2020-02-10 20:19:14,584 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:14,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:15,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:15,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328109523] [2020-02-10 20:19:15,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:15,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:15,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166905822] [2020-02-10 20:19:15,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:15,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:15,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:15,007 INFO L87 Difference]: Start difference. First operand 801 states and 3131 transitions. Second operand 10 states. [2020-02-10 20:19:15,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,127 INFO L93 Difference]: Finished difference Result 1464 states and 5023 transitions. [2020-02-10 20:19:15,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:15,127 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:15,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,131 INFO L225 Difference]: With dead ends: 1464 [2020-02-10 20:19:15,131 INFO L226 Difference]: Without dead ends: 1412 [2020-02-10 20:19:15,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:15,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2020-02-10 20:19:15,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 767. [2020-02-10 20:19:15,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2020-02-10 20:19:15,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 3065 transitions. [2020-02-10 20:19:15,155 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 3065 transitions. Word has length 25 [2020-02-10 20:19:15,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,155 INFO L479 AbstractCegarLoop]: Abstraction has 767 states and 3065 transitions. [2020-02-10 20:19:15,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:15,155 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 3065 transitions. [2020-02-10 20:19:15,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:15,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,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, 1, 1, 1] [2020-02-10 20:19:15,157 INFO L427 AbstractCegarLoop]: === Iteration 728 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1154951873, now seen corresponding path program 721 times [2020-02-10 20:19:15,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991133391] [2020-02-10 20:19:15,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:15,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:15,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991133391] [2020-02-10 20:19:15,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:15,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:15,534 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971599303] [2020-02-10 20:19:15,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:15,534 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:15,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:15,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:15,534 INFO L87 Difference]: Start difference. First operand 767 states and 3065 transitions. Second operand 10 states. [2020-02-10 20:19:15,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:15,674 INFO L93 Difference]: Finished difference Result 1241 states and 4395 transitions. [2020-02-10 20:19:15,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:15,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:15,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:15,678 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:19:15,678 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:19:15,678 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:15,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:19:15,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 20:19:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:19:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3127 transitions. [2020-02-10 20:19:15,699 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3127 transitions. Word has length 25 [2020-02-10 20:19:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:15,699 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3127 transitions. [2020-02-10 20:19:15,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:15,699 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3127 transitions. [2020-02-10 20:19:15,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:15,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:15,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, 1, 1, 1] [2020-02-10 20:19:15,701 INFO L427 AbstractCegarLoop]: === Iteration 729 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:15,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:15,701 INFO L82 PathProgramCache]: Analyzing trace with hash -184700259, now seen corresponding path program 722 times [2020-02-10 20:19:15,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:15,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357608371] [2020-02-10 20:19:15,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:15,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:16,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357608371] [2020-02-10 20:19:16,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:16,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913946225] [2020-02-10 20:19:16,078 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:16,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:16,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:16,078 INFO L87 Difference]: Start difference. First operand 782 states and 3127 transitions. Second operand 10 states. [2020-02-10 20:19:16,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:16,221 INFO L93 Difference]: Finished difference Result 1243 states and 4395 transitions. [2020-02-10 20:19:16,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:16,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:16,224 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:19:16,225 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:16,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:16,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:16,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:19:16,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3117 transitions. [2020-02-10 20:19:16,246 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3117 transitions. Word has length 25 [2020-02-10 20:19:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:16,246 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3117 transitions. [2020-02-10 20:19:16,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3117 transitions. [2020-02-10 20:19:16,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:16,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:16,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:16,247 INFO L427 AbstractCegarLoop]: === Iteration 730 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:16,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:16,248 INFO L82 PathProgramCache]: Analyzing trace with hash 771082205, now seen corresponding path program 723 times [2020-02-10 20:19:16,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:16,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097035809] [2020-02-10 20:19:16,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:16,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:16,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 20:19:16,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097035809] [2020-02-10 20:19:16,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:16,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:16,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233144315] [2020-02-10 20:19:16,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:16,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:16,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:16,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:16,630 INFO L87 Difference]: Start difference. First operand 778 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:19:16,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:16,769 INFO L93 Difference]: Finished difference Result 1237 states and 4383 transitions. [2020-02-10 20:19:16,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:16,769 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:16,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:16,773 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:19:16,773 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:16,773 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:16,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 20:19:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:16,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3122 transitions. [2020-02-10 20:19:16,795 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3122 transitions. Word has length 25 [2020-02-10 20:19:16,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:16,795 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3122 transitions. [2020-02-10 20:19:16,795 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:16,795 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3122 transitions. [2020-02-10 20:19:16,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:16,796 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:16,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, 1, 1, 1] [2020-02-10 20:19:16,796 INFO L427 AbstractCegarLoop]: === Iteration 731 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:16,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:16,796 INFO L82 PathProgramCache]: Analyzing trace with hash 1751836923, now seen corresponding path program 724 times [2020-02-10 20:19:16,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:16,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545431794] [2020-02-10 20:19:16,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:17,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:17,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545431794] [2020-02-10 20:19:17,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:17,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:17,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353906463] [2020-02-10 20:19:17,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:17,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:17,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:17,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:17,181 INFO L87 Difference]: Start difference. First operand 781 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:19:17,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,357 INFO L93 Difference]: Finished difference Result 1236 states and 4378 transitions. [2020-02-10 20:19:17,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:17,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:17,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,361 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:19:17,361 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:19:17,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:17,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:19:17,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 20:19:17,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 20:19:17,382 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 20:19:17,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,383 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 20:19:17,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 20:19:17,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:17,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,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, 1, 1, 1] [2020-02-10 20:19:17,384 INFO L427 AbstractCegarLoop]: === Iteration 732 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,384 INFO L82 PathProgramCache]: Analyzing trace with hash 153924927, now seen corresponding path program 725 times [2020-02-10 20:19:17,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579684255] [2020-02-10 20:19:17,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:17,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:17,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579684255] [2020-02-10 20:19:17,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:17,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:17,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108152407] [2020-02-10 20:19:17,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:17,763 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:17,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:17,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:17,764 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:19:17,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:17,901 INFO L93 Difference]: Finished difference Result 1241 states and 4388 transitions. [2020-02-10 20:19:17,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:17,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:17,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:17,905 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:19:17,905 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:19:17,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:19:17,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:19:17,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:17,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:19:17,926 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:17,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:17,926 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:19:17,926 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:17,926 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:19:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:17,927 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:17,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, 1, 1, 1] [2020-02-10 20:19:17,927 INFO L427 AbstractCegarLoop]: === Iteration 733 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1764865885, now seen corresponding path program 726 times [2020-02-10 20:19:17,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:17,928 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788500675] [2020-02-10 20:19:17,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788500675] [2020-02-10 20:19:18,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:18,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932719473] [2020-02-10 20:19:18,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:18,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:18,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:18,304 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:18,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:18,452 INFO L93 Difference]: Finished difference Result 1238 states and 4379 transitions. [2020-02-10 20:19:18,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:18,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:18,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:18,455 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:18,455 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:19:18,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:18,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:19:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 20:19:18,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3106 transitions. [2020-02-10 20:19:18,476 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3106 transitions. Word has length 25 [2020-02-10 20:19:18,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:18,476 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3106 transitions. [2020-02-10 20:19:18,476 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3106 transitions. [2020-02-10 20:19:18,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:18,477 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:18,478 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:18,478 INFO L427 AbstractCegarLoop]: === Iteration 734 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:18,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:18,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1577437599, now seen corresponding path program 727 times [2020-02-10 20:19:18,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:18,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652509841] [2020-02-10 20:19:18,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:18,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:18,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652509841] [2020-02-10 20:19:18,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:18,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:18,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608439197] [2020-02-10 20:19:18,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:18,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:18,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:18,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:18,855 INFO L87 Difference]: Start difference. First operand 775 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:19:18,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:18,998 INFO L93 Difference]: Finished difference Result 1250 states and 4416 transitions. [2020-02-10 20:19:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:18,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:18,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,002 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:19:19,002 INFO L226 Difference]: Without dead ends: 1237 [2020-02-10 20:19:19,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:19,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2020-02-10 20:19:19,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 783. [2020-02-10 20:19:19,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:19,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3128 transitions. [2020-02-10 20:19:19,024 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3128 transitions. Word has length 25 [2020-02-10 20:19:19,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,024 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3128 transitions. [2020-02-10 20:19:19,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:19,024 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3128 transitions. [2020-02-10 20:19:19,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:19,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,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, 1, 1, 1] [2020-02-10 20:19:19,025 INFO L427 AbstractCegarLoop]: === Iteration 735 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash -607185985, now seen corresponding path program 728 times [2020-02-10 20:19:19,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613504643] [2020-02-10 20:19:19,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:19,436 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:19,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613504643] [2020-02-10 20:19:19,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:19,436 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:19,436 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641637162] [2020-02-10 20:19:19,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:19,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:19,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:19,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:19,437 INFO L87 Difference]: Start difference. First operand 783 states and 3128 transitions. Second operand 10 states. [2020-02-10 20:19:19,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:19,612 INFO L93 Difference]: Finished difference Result 1252 states and 4416 transitions. [2020-02-10 20:19:19,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:19,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:19,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:19,616 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:19:19,616 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:19:19,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:19,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:19:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 779. [2020-02-10 20:19:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:19:19,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3117 transitions. [2020-02-10 20:19:19,637 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3117 transitions. Word has length 25 [2020-02-10 20:19:19,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:19,637 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3117 transitions. [2020-02-10 20:19:19,637 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:19,637 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3117 transitions. [2020-02-10 20:19:19,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:19,638 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:19,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, 1, 1, 1] [2020-02-10 20:19:19,639 INFO L427 AbstractCegarLoop]: === Iteration 736 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash -2020336739, now seen corresponding path program 729 times [2020-02-10 20:19:19,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:19,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450853716] [2020-02-10 20:19:19,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:20,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:20,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450853716] [2020-02-10 20:19:20,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:20,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:20,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409732500] [2020-02-10 20:19:20,039 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:20,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:20,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:20,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:20,039 INFO L87 Difference]: Start difference. First operand 779 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:19:20,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:20,176 INFO L93 Difference]: Finished difference Result 1251 states and 4414 transitions. [2020-02-10 20:19:20,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:20,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:20,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:20,180 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 20:19:20,180 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:19:20,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:20,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:19:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 20:19:20,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 20:19:20,202 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 20:19:20,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,202 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 20:19:20,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 20:19:20,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:20,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,204 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:20,204 INFO L427 AbstractCegarLoop]: === Iteration 737 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1029078917, now seen corresponding path program 730 times [2020-02-10 20:19:20,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645734096] [2020-02-10 20:19:20,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:20,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:20,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645734096] [2020-02-10 20:19:20,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:20,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:20,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275884695] [2020-02-10 20:19:20,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:20,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:20,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:20,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:20,579 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:19:20,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:20,725 INFO L93 Difference]: Finished difference Result 1254 states and 4416 transitions. [2020-02-10 20:19:20,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:20,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:20,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:20,729 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:19:20,729 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:19:20,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:19:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 779. [2020-02-10 20:19:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:19:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 20:19:20,751 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 20:19:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:20,751 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 20:19:20,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:20,751 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 20:19:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:20,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:20,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, 1, 1, 1] [2020-02-10 20:19:20,752 INFO L427 AbstractCegarLoop]: === Iteration 738 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:20,752 INFO L82 PathProgramCache]: Analyzing trace with hash 57035425, now seen corresponding path program 731 times [2020-02-10 20:19:20,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:20,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055178295] [2020-02-10 20:19:20,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,135 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055178295] [2020-02-10 20:19:21,135 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,135 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:21,135 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911292470] [2020-02-10 20:19:21,135 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:21,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:21,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:21,135 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:19:21,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,277 INFO L93 Difference]: Finished difference Result 1257 states and 4424 transitions. [2020-02-10 20:19:21,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:21,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:21,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,281 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:19:21,281 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:19:21,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:21,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:19:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 785. [2020-02-10 20:19:21,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:19:21,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3124 transitions. [2020-02-10 20:19:21,302 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3124 transitions. Word has length 25 [2020-02-10 20:19:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:21,302 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3124 transitions. [2020-02-10 20:19:21,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:21,302 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3124 transitions. [2020-02-10 20:19:21,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:21,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:21,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:21,304 INFO L427 AbstractCegarLoop]: === Iteration 739 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:21,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:21,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1016049955, now seen corresponding path program 732 times [2020-02-10 20:19:21,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:21,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803602901] [2020-02-10 20:19:21,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:21,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:21,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803602901] [2020-02-10 20:19:21,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:21,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:21,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797541427] [2020-02-10 20:19:21,692 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:21,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:21,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:21,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:21,692 INFO L87 Difference]: Start difference. First operand 785 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:19:21,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:21,843 INFO L93 Difference]: Finished difference Result 1258 states and 4420 transitions. [2020-02-10 20:19:21,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:21,843 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:21,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:21,846 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:19:21,846 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:19:21,847 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:21,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:19:21,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 775. [2020-02-10 20:19:21,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:21,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 20:19:21,868 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 20:19:21,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:21,868 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 20:19:21,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:21,868 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 20:19:21,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:21,869 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:21,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, 1, 1, 1] [2020-02-10 20:19:21,869 INFO L427 AbstractCegarLoop]: === Iteration 740 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:21,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:21,869 INFO L82 PathProgramCache]: Analyzing trace with hash -73889247, now seen corresponding path program 733 times [2020-02-10 20:19:21,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:21,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399361635] [2020-02-10 20:19:21,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399361635] [2020-02-10 20:19:22,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:22,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076809242] [2020-02-10 20:19:22,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:22,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:22,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:22,274 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:19:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:22,412 INFO L93 Difference]: Finished difference Result 1238 states and 4382 transitions. [2020-02-10 20:19:22,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:22,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:22,416 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:22,416 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:19:22,416 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:22,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:19:22,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 20:19:22,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:19:22,437 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,437 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:19:22,437 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:19:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:22,438 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,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, 1, 1, 1] [2020-02-10 20:19:22,438 INFO L427 AbstractCegarLoop]: === Iteration 741 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,438 INFO L82 PathProgramCache]: Analyzing trace with hash 906865471, now seen corresponding path program 734 times [2020-02-10 20:19:22,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919336517] [2020-02-10 20:19:22,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:22,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919336517] [2020-02-10 20:19:22,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:22,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:22,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985716261] [2020-02-10 20:19:22,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:22,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:22,821 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:22,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:22,973 INFO L93 Difference]: Finished difference Result 1237 states and 4377 transitions. [2020-02-10 20:19:22,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:22,973 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:22,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:22,976 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:19:22,976 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:19:22,976 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:22,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:19:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 20:19:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:22,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 20:19:22,997 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 20:19:22,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:22,997 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 20:19:22,997 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:22,997 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 20:19:22,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:22,998 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:22,998 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:22,998 INFO L427 AbstractCegarLoop]: === Iteration 742 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:22,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:22,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1852144831, now seen corresponding path program 735 times [2020-02-10 20:19:22,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:22,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723684577] [2020-02-10 20:19:22,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:23,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723684577] [2020-02-10 20:19:23,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:23,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672847337] [2020-02-10 20:19:23,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:23,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:23,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:23,381 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:19:23,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:23,518 INFO L93 Difference]: Finished difference Result 1243 states and 4390 transitions. [2020-02-10 20:19:23,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:23,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:23,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:23,522 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:19:23,522 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:19:23,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:23,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:19:23,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 782. [2020-02-10 20:19:23,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:19:23,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 20:19:23,544 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 20:19:23,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:23,544 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 20:19:23,544 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:23,544 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 20:19:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:23,545 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:23,545 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:23,545 INFO L427 AbstractCegarLoop]: === Iteration 743 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:23,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1451564643, now seen corresponding path program 736 times [2020-02-10 20:19:23,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:23,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621750683] [2020-02-10 20:19:23,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:23,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:23,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:23,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621750683] [2020-02-10 20:19:23,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:23,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:23,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730381981] [2020-02-10 20:19:23,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:23,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:23,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:23,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:23,927 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:19:24,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,079 INFO L93 Difference]: Finished difference Result 1246 states and 4392 transitions. [2020-02-10 20:19:24,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:24,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:24,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,083 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:19:24,083 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:19:24,083 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:24,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:19:24,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 778. [2020-02-10 20:19:24,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:24,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:19:24,104 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:19:24,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,104 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:19:24,104 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:24,104 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:19:24,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:24,105 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,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, 1, 1, 1] [2020-02-10 20:19:24,105 INFO L427 AbstractCegarLoop]: === Iteration 744 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,105 INFO L82 PathProgramCache]: Analyzing trace with hash 1571086881, now seen corresponding path program 737 times [2020-02-10 20:19:24,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449476388] [2020-02-10 20:19:24,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:24,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 20:19:24,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449476388] [2020-02-10 20:19:24,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:24,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:24,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864813753] [2020-02-10 20:19:24,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:24,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:24,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:24,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:24,498 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:19:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:24,651 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 20:19:24,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:24,652 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:24,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:24,655 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:19:24,655 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:19:24,655 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:24,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:19:24,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 20:19:24,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:19:24,693 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:19:24,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:24,693 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:19:24,693 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:24,693 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:19:24,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:24,694 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:24,694 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:24,694 INFO L427 AbstractCegarLoop]: === Iteration 745 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:24,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:24,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1112939457, now seen corresponding path program 738 times [2020-02-10 20:19:24,695 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:24,695 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867563607] [2020-02-10 20:19:24,695 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:24,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,079 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867563607] [2020-02-10 20:19:25,079 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:25,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706771576] [2020-02-10 20:19:25,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:25,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:25,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:25,080 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:19:25,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:25,230 INFO L93 Difference]: Finished difference Result 1244 states and 4385 transitions. [2020-02-10 20:19:25,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:25,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:25,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:25,234 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:25,234 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:19:25,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:25,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:19:25,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 775. [2020-02-10 20:19:25,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:25,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 20:19:25,255 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 20:19:25,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:25,255 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 20:19:25,255 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:25,255 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 20:19:25,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:25,256 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19: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, 1, 1, 1] [2020-02-10 20:19:25,257 INFO L427 AbstractCegarLoop]: === Iteration 746 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:25,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:25,257 INFO L82 PathProgramCache]: Analyzing trace with hash -730047843, now seen corresponding path program 739 times [2020-02-10 20:19:25,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:25,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666711381] [2020-02-10 20:19:25,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:25,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:25,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:25,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666711381] [2020-02-10 20:19:25,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:25,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:25,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347786027] [2020-02-10 20:19:25,646 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:25,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:25,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:25,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:25,646 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:19:25,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:25,795 INFO L93 Difference]: Finished difference Result 1246 states and 4397 transitions. [2020-02-10 20:19:25,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:25,796 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:25,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:25,799 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:19:25,799 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:19:25,799 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:25,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:19:25,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 20:19:25,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:25,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:19:25,821 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:19:25,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:25,821 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:19:25,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:25,821 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:19:25,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:25,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:25,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, 1, 1, 1] [2020-02-10 20:19:25,822 INFO L427 AbstractCegarLoop]: === Iteration 747 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:25,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:25,822 INFO L82 PathProgramCache]: Analyzing trace with hash 880893115, now seen corresponding path program 740 times [2020-02-10 20:19:25,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:25,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944758981] [2020-02-10 20:19:25,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:25,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944758981] [2020-02-10 20:19:26,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:26,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358656184] [2020-02-10 20:19:26,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:26,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:26,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:26,213 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:19:26,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,405 INFO L93 Difference]: Finished difference Result 1243 states and 4388 transitions. [2020-02-10 20:19:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:26,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:26,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,409 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:19:26,409 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:19:26,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:26,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:19:26,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 778. [2020-02-10 20:19:26,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:26,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:19:26,431 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:19:26,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,431 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:19:26,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:26,431 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:19:26,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:26,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,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, 1, 1, 1] [2020-02-10 20:19:26,432 INFO L427 AbstractCegarLoop]: === Iteration 748 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1964481599, now seen corresponding path program 741 times [2020-02-10 20:19:26,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509841406] [2020-02-10 20:19:26,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:26,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:26,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509841406] [2020-02-10 20:19:26,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:26,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:26,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128148096] [2020-02-10 20:19:26,809 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:26,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:26,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:26,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:26,809 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:19:26,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:26,956 INFO L93 Difference]: Finished difference Result 1253 states and 4411 transitions. [2020-02-10 20:19:26,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:26,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:26,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:26,959 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:19:26,959 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:19:26,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:26,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:19:26,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 784. [2020-02-10 20:19:26,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:26,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:19:26,980 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:26,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:26,980 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:19:26,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:26,981 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:19:26,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:26,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:26,982 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:26,982 INFO L427 AbstractCegarLoop]: === Iteration 749 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:26,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:26,982 INFO L82 PathProgramCache]: Analyzing trace with hash 891396219, now seen corresponding path program 742 times [2020-02-10 20:19:26,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:26,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735357835] [2020-02-10 20:19:26,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,378 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 27 [2020-02-10 20:19:27,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 20:19:27,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735357835] [2020-02-10 20:19:27,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:27,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585964177] [2020-02-10 20:19:27,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:27,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:27,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:27,384 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:27,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:27,534 INFO L93 Difference]: Finished difference Result 1254 states and 4407 transitions. [2020-02-10 20:19:27,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:27,535 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:27,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:27,538 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:19:27,538 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:19:27,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:27,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:19:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 20:19:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:27,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:19:27,560 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:19:27,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:27,560 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:19:27,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:19:27,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:27,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:27,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, 1, 1, 1] [2020-02-10 20:19:27,561 INFO L427 AbstractCegarLoop]: === Iteration 750 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:27,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1974984703, now seen corresponding path program 743 times [2020-02-10 20:19:27,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:27,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897111811] [2020-02-10 20:19:27,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:27,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:27,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:27,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897111811] [2020-02-10 20:19:27,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:27,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:27,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650152440] [2020-02-10 20:19:27,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:27,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:27,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:27,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:27,944 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:19:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,111 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:19:28,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:28,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,115 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:28,115 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:19:28,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:19:28,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:19:28,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:28,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:19:28,137 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:19:28,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,137 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:19:28,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:28,137 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:19:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:28,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,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, 1, 1, 1] [2020-02-10 20:19:28,138 INFO L427 AbstractCegarLoop]: === Iteration 751 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,139 INFO L82 PathProgramCache]: Analyzing trace with hash -709041635, now seen corresponding path program 744 times [2020-02-10 20:19:28,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460111617] [2020-02-10 20:19:28,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:28,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:28,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460111617] [2020-02-10 20:19:28,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:28,522 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:28,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642189332] [2020-02-10 20:19:28,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:28,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:28,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:28,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:28,523 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:19:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:28,676 INFO L93 Difference]: Finished difference Result 1248 states and 4392 transitions. [2020-02-10 20:19:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:28,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:28,679 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:19:28,679 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:19:28,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:28,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:19:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 772. [2020-02-10 20:19:28,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:19:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3092 transitions. [2020-02-10 20:19:28,700 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3092 transitions. Word has length 25 [2020-02-10 20:19:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:28,700 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3092 transitions. [2020-02-10 20:19:28,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3092 transitions. [2020-02-10 20:19:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:28,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:28,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, 1, 1, 1] [2020-02-10 20:19:28,702 INFO L427 AbstractCegarLoop]: === Iteration 752 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1367107491, now seen corresponding path program 745 times [2020-02-10 20:19:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321734053] [2020-02-10 20:19:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321734053] [2020-02-10 20:19:29,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,083 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:29,083 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351100238] [2020-02-10 20:19:29,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:29,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:29,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:29,084 INFO L87 Difference]: Start difference. First operand 772 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:19:29,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,233 INFO L93 Difference]: Finished difference Result 1238 states and 4385 transitions. [2020-02-10 20:19:29,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:29,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,237 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:29,237 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:19:29,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:29,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:19:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 782. [2020-02-10 20:19:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:19:29,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3124 transitions. [2020-02-10 20:19:29,259 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3124 transitions. Word has length 25 [2020-02-10 20:19:29,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,259 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3124 transitions. [2020-02-10 20:19:29,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3124 transitions. [2020-02-10 20:19:29,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:29,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,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, 1, 1, 1] [2020-02-10 20:19:29,260 INFO L427 AbstractCegarLoop]: === Iteration 753 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,260 INFO L82 PathProgramCache]: Analyzing trace with hash -396855877, now seen corresponding path program 746 times [2020-02-10 20:19:29,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188132910] [2020-02-10 20:19:29,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:29,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:29,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188132910] [2020-02-10 20:19:29,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:29,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:29,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636287243] [2020-02-10 20:19:29,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:29,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:29,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:29,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:29,639 INFO L87 Difference]: Start difference. First operand 782 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:19:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:29,790 INFO L93 Difference]: Finished difference Result 1240 states and 4385 transitions. [2020-02-10 20:19:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:29,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:29,793 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:19:29,794 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:19:29,794 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:29,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:19:29,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 778. [2020-02-10 20:19:29,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:29,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3114 transitions. [2020-02-10 20:19:29,815 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3114 transitions. Word has length 25 [2020-02-10 20:19:29,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:29,815 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3114 transitions. [2020-02-10 20:19:29,815 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:29,815 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3114 transitions. [2020-02-10 20:19:29,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:29,816 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:29,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, 1, 1, 1] [2020-02-10 20:19:29,816 INFO L427 AbstractCegarLoop]: === Iteration 754 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:29,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:29,817 INFO L82 PathProgramCache]: Analyzing trace with hash 558926587, now seen corresponding path program 747 times [2020-02-10 20:19:29,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:29,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875287648] [2020-02-10 20:19:29,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,126 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 19 [2020-02-10 20:19:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875287648] [2020-02-10 20:19:30,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:30,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624762442] [2020-02-10 20:19:30,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:30,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:30,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:30,384 INFO L87 Difference]: Start difference. First operand 778 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:19:30,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:30,579 INFO L93 Difference]: Finished difference Result 1234 states and 4373 transitions. [2020-02-10 20:19:30,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:30,579 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:30,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:30,583 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:19:30,583 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:19:30,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:19:30,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:19:30,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:30,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:19:30,605 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:30,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:30,605 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:19:30,605 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:30,605 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:19:30,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:30,606 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:30,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, 1, 1, 1] [2020-02-10 20:19:30,606 INFO L427 AbstractCegarLoop]: === Iteration 755 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:30,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:30,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1539681305, now seen corresponding path program 748 times [2020-02-10 20:19:30,606 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:30,606 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889867335] [2020-02-10 20:19:30,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:30,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:30,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:30,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889867335] [2020-02-10 20:19:30,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:30,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:30,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617217201] [2020-02-10 20:19:30,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:30,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:30,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:30,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:30,996 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:31,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,149 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 20:19:31,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:31,149 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:31,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,152 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:19:31,153 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:19:31,153 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:31,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:19:31,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:19:31,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3111 transitions. [2020-02-10 20:19:31,174 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3111 transitions. Word has length 25 [2020-02-10 20:19:31,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,174 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3111 transitions. [2020-02-10 20:19:31,174 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:31,174 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3111 transitions. [2020-02-10 20:19:31,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:31,175 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,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, 1, 1, 1] [2020-02-10 20:19:31,175 INFO L427 AbstractCegarLoop]: === Iteration 756 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,176 INFO L82 PathProgramCache]: Analyzing trace with hash -58230691, now seen corresponding path program 749 times [2020-02-10 20:19:31,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675684236] [2020-02-10 20:19:31,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:31,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:31,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675684236] [2020-02-10 20:19:31,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:31,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:31,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628556176] [2020-02-10 20:19:31,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:31,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:31,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:31,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:31,566 INFO L87 Difference]: Start difference. First operand 778 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:19:31,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:31,712 INFO L93 Difference]: Finished difference Result 1238 states and 4378 transitions. [2020-02-10 20:19:31,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:31,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:31,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:31,716 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:31,716 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:19:31,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:31,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:19:31,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 20:19:31,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:19:31,738 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:19:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:31,738 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:19:31,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:19:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:31,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:31,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, 1, 1, 1] [2020-02-10 20:19:31,739 INFO L427 AbstractCegarLoop]: === Iteration 757 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:31,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1552710267, now seen corresponding path program 750 times [2020-02-10 20:19:31,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:31,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802911289] [2020-02-10 20:19:31,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802911289] [2020-02-10 20:19:32,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:32,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921675523] [2020-02-10 20:19:32,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:32,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:32,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:32,132 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:19:32,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,292 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 20:19:32,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:32,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:32,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,295 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:19:32,295 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 20:19:32,295 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:32,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 20:19:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 775. [2020-02-10 20:19:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:32,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3103 transitions. [2020-02-10 20:19:32,316 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3103 transitions. Word has length 25 [2020-02-10 20:19:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,316 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3103 transitions. [2020-02-10 20:19:32,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3103 transitions. [2020-02-10 20:19:32,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:32,317 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,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, 1, 1, 1] [2020-02-10 20:19:32,318 INFO L427 AbstractCegarLoop]: === Iteration 758 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,318 INFO L82 PathProgramCache]: Analyzing trace with hash 2082888353, now seen corresponding path program 751 times [2020-02-10 20:19:32,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,318 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916500705] [2020-02-10 20:19:32,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:32,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916500705] [2020-02-10 20:19:32,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:32,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:32,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632310515] [2020-02-10 20:19:32,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:32,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:32,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:32,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:32,703 INFO L87 Difference]: Start difference. First operand 775 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:19:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:32,901 INFO L93 Difference]: Finished difference Result 1244 states and 4399 transitions. [2020-02-10 20:19:32,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:32,901 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:32,905 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:32,905 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:19:32,905 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:32,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:19:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 783. [2020-02-10 20:19:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:32,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3125 transitions. [2020-02-10 20:19:32,936 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3125 transitions. Word has length 25 [2020-02-10 20:19:32,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:32,936 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3125 transitions. [2020-02-10 20:19:32,936 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3125 transitions. [2020-02-10 20:19:32,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:32,937 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:32,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, 1, 1, 1] [2020-02-10 20:19:32,937 INFO L427 AbstractCegarLoop]: === Iteration 759 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1241827329, now seen corresponding path program 752 times [2020-02-10 20:19:32,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:32,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474417577] [2020-02-10 20:19:32,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:32,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:33,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:33,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474417577] [2020-02-10 20:19:33,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:33,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:33,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245813897] [2020-02-10 20:19:33,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:33,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:33,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:33,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:33,339 INFO L87 Difference]: Start difference. First operand 783 states and 3125 transitions. Second operand 10 states. [2020-02-10 20:19:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:33,492 INFO L93 Difference]: Finished difference Result 1246 states and 4399 transitions. [2020-02-10 20:19:33,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:33,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:33,495 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:19:33,496 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 20:19:33,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:33,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 20:19:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 779. [2020-02-10 20:19:33,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:19:33,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3114 transitions. [2020-02-10 20:19:33,517 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3114 transitions. Word has length 25 [2020-02-10 20:19:33,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:33,517 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3114 transitions. [2020-02-10 20:19:33,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:33,517 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3114 transitions. [2020-02-10 20:19:33,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:33,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:33,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, 1, 1, 1] [2020-02-10 20:19:33,519 INFO L427 AbstractCegarLoop]: === Iteration 760 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:33,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:33,519 INFO L82 PathProgramCache]: Analyzing trace with hash -728944005, now seen corresponding path program 753 times [2020-02-10 20:19:33,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:33,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867310684] [2020-02-10 20:19:33,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:33,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:33,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867310684] [2020-02-10 20:19:33,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:33,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:33,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42260120] [2020-02-10 20:19:33,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:33,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:33,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:33,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:33,916 INFO L87 Difference]: Start difference. First operand 779 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:19:34,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,066 INFO L93 Difference]: Finished difference Result 1243 states and 4393 transitions. [2020-02-10 20:19:34,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:34,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:34,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,070 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:19:34,070 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:19:34,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:34,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:19:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:19:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:34,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3121 transitions. [2020-02-10 20:19:34,092 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3121 transitions. Word has length 25 [2020-02-10 20:19:34,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,093 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3121 transitions. [2020-02-10 20:19:34,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:34,093 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3121 transitions. [2020-02-10 20:19:34,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:34,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,094 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:34,094 INFO L427 AbstractCegarLoop]: === Iteration 761 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,094 INFO L82 PathProgramCache]: Analyzing trace with hash 272816921, now seen corresponding path program 754 times [2020-02-10 20:19:34,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361660184] [2020-02-10 20:19:34,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:34,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 20:19:34,486 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361660184] [2020-02-10 20:19:34,486 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:34,486 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:34,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218470203] [2020-02-10 20:19:34,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:34,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:34,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:34,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:34,487 INFO L87 Difference]: Start difference. First operand 783 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:19:34,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:34,638 INFO L93 Difference]: Finished difference Result 1244 states and 4391 transitions. [2020-02-10 20:19:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:34,639 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:34,642 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:34,642 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:19:34,642 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:34,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:19:34,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:19:34,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:19:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3110 transitions. [2020-02-10 20:19:34,663 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3110 transitions. Word has length 25 [2020-02-10 20:19:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:34,663 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3110 transitions. [2020-02-10 20:19:34,663 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:34,663 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3110 transitions. [2020-02-10 20:19:34,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:34,664 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:34,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, 1, 1, 1] [2020-02-10 20:19:34,664 INFO L427 AbstractCegarLoop]: === Iteration 762 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:34,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:34,664 INFO L82 PathProgramCache]: Analyzing trace with hash -252009695, now seen corresponding path program 755 times [2020-02-10 20:19:34,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:34,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994411040] [2020-02-10 20:19:34,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:34,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994411040] [2020-02-10 20:19:35,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:35,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62461781] [2020-02-10 20:19:35,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:35,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:35,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:35,060 INFO L87 Difference]: Start difference. First operand 779 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:19:35,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,212 INFO L93 Difference]: Finished difference Result 1248 states and 4400 transitions. [2020-02-10 20:19:35,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:35,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:35,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,216 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:19:35,216 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:19:35,216 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:35,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:19:35,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 784. [2020-02-10 20:19:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:35,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3119 transitions. [2020-02-10 20:19:35,237 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,238 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3119 transitions. [2020-02-10 20:19:35,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:35,238 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3119 transitions. [2020-02-10 20:19:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:35,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,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, 1, 1, 1] [2020-02-10 20:19:35,239 INFO L427 AbstractCegarLoop]: === Iteration 763 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,239 INFO L82 PathProgramCache]: Analyzing trace with hash 285845883, now seen corresponding path program 756 times [2020-02-10 20:19:35,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357514704] [2020-02-10 20:19:35,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:35,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:35,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357514704] [2020-02-10 20:19:35,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:35,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:35,635 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918550263] [2020-02-10 20:19:35,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:35,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:35,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:35,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:35,636 INFO L87 Difference]: Start difference. First operand 784 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:35,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:35,803 INFO L93 Difference]: Finished difference Result 1247 states and 4393 transitions. [2020-02-10 20:19:35,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:35,803 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:35,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:35,807 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:19:35,807 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:35,807 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:35,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:35,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 775. [2020-02-10 20:19:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3100 transitions. [2020-02-10 20:19:35,828 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3100 transitions. Word has length 25 [2020-02-10 20:19:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:35,828 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3100 transitions. [2020-02-10 20:19:35,828 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:35,828 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3100 transitions. [2020-02-10 20:19:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:35,829 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:35,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, 1, 1, 1] [2020-02-10 20:19:35,829 INFO L427 AbstractCegarLoop]: === Iteration 764 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:35,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:35,829 INFO L82 PathProgramCache]: Analyzing trace with hash -708530591, now seen corresponding path program 757 times [2020-02-10 20:19:35,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:35,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172077958] [2020-02-10 20:19:35,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:35,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:36,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:36,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172077958] [2020-02-10 20:19:36,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:36,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:36,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857444974] [2020-02-10 20:19:36,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:36,216 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:36,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:36,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:36,216 INFO L87 Difference]: Start difference. First operand 775 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:19:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,387 INFO L93 Difference]: Finished difference Result 1233 states and 4368 transitions. [2020-02-10 20:19:36,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:36,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:36,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,390 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:19:36,391 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:19:36,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:36,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:19:36,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 781. [2020-02-10 20:19:36,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:36,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:19:36,411 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:19:36,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,412 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:19:36,412 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:36,412 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:19:36,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:36,413 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,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, 1, 1, 1] [2020-02-10 20:19:36,413 INFO L427 AbstractCegarLoop]: === Iteration 765 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,413 INFO L82 PathProgramCache]: Analyzing trace with hash 272224127, now seen corresponding path program 758 times [2020-02-10 20:19:36,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62719758] [2020-02-10 20:19:36,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:36,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:36,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62719758] [2020-02-10 20:19:36,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:36,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:36,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296811132] [2020-02-10 20:19:36,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:36,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:36,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:36,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:36,812 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:19:36,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:36,962 INFO L93 Difference]: Finished difference Result 1232 states and 4363 transitions. [2020-02-10 20:19:36,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:36,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:36,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:36,965 INFO L225 Difference]: With dead ends: 1232 [2020-02-10 20:19:36,965 INFO L226 Difference]: Without dead ends: 1217 [2020-02-10 20:19:36,966 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:36,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2020-02-10 20:19:36,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 778. [2020-02-10 20:19:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:36,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:19:36,986 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:19:36,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:36,986 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:19:36,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:36,986 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:19:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:36,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:36,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, 1, 1, 1] [2020-02-10 20:19:36,988 INFO L427 AbstractCegarLoop]: === Iteration 766 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:36,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1151429731, now seen corresponding path program 759 times [2020-02-10 20:19:36,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:36,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203904052] [2020-02-10 20:19:36,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203904052] [2020-02-10 20:19:37,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:37,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394037264] [2020-02-10 20:19:37,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:37,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:37,381 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:19:37,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:37,525 INFO L93 Difference]: Finished difference Result 1236 states and 4372 transitions. [2020-02-10 20:19:37,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:37,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:37,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:37,528 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:19:37,529 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:19:37,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:37,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:19:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 782. [2020-02-10 20:19:37,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:19:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 20:19:37,550 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 20:19:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:37,550 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 20:19:37,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:37,551 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 20:19:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:37,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:37,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, 1, 1, 1] [2020-02-10 20:19:37,552 INFO L427 AbstractCegarLoop]: === Iteration 767 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:37,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash -149668805, now seen corresponding path program 760 times [2020-02-10 20:19:37,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:37,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956831948] [2020-02-10 20:19:37,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:37,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:37,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:37,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956831948] [2020-02-10 20:19:37,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:37,944 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:37,944 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906555301] [2020-02-10 20:19:37,945 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:37,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:37,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:37,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:37,945 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:19:38,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,093 INFO L93 Difference]: Finished difference Result 1237 states and 4370 transitions. [2020-02-10 20:19:38,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:38,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:38,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,097 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:19:38,097 INFO L226 Difference]: Without dead ends: 1219 [2020-02-10 20:19:38,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:38,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1219 states. [2020-02-10 20:19:38,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1219 to 778. [2020-02-10 20:19:38,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:38,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:19:38,119 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:19:38,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:38,119 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:19:38,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:19:38,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:38,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:38,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, 1, 1, 1] [2020-02-10 20:19:38,120 INFO L427 AbstractCegarLoop]: === Iteration 768 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:38,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:38,120 INFO L82 PathProgramCache]: Analyzing trace with hash 1262041761, now seen corresponding path program 761 times [2020-02-10 20:19:38,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:38,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081396887] [2020-02-10 20:19:38,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:38,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:38,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081396887] [2020-02-10 20:19:38,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:38,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:38,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183679970] [2020-02-10 20:19:38,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:38,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:38,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:38,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:38,526 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:19:38,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:38,663 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 20:19:38,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:38,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:38,667 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:19:38,667 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:19:38,667 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:38,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:19:38,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:19:38,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:38,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:19:38,699 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:19:38,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:38,699 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:19:38,699 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:19:38,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:38,700 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:38,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, 1, 1, 1] [2020-02-10 20:19:38,700 INFO L427 AbstractCegarLoop]: === Iteration 769 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:38,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:38,700 INFO L82 PathProgramCache]: Analyzing trace with hash 188956381, now seen corresponding path program 762 times [2020-02-10 20:19:38,701 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:38,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141149750] [2020-02-10 20:19:38,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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 20:19:39,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141149750] [2020-02-10 20:19:39,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:39,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298218567] [2020-02-10 20:19:39,084 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:39,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:39,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:39,085 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:19:39,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,228 INFO L93 Difference]: Finished difference Result 1235 states and 4363 transitions. [2020-02-10 20:19:39,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:39,228 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:39,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,231 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:19:39,231 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 20:19:39,232 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:39,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 20:19:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 775. [2020-02-10 20:19:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:39,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:19:39,252 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:19:39,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,253 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:19:39,253 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:39,253 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:19:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:39,254 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,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, 1, 1, 1] [2020-02-10 20:19:39,254 INFO L427 AbstractCegarLoop]: === Iteration 770 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,254 INFO L82 PathProgramCache]: Analyzing trace with hash 561344891, now seen corresponding path program 763 times [2020-02-10 20:19:39,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707930721] [2020-02-10 20:19:39,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:39,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:39,637 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707930721] [2020-02-10 20:19:39,637 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:39,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:39,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979515274] [2020-02-10 20:19:39,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:39,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:39,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:39,638 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:19:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:39,782 INFO L93 Difference]: Finished difference Result 1240 states and 4380 transitions. [2020-02-10 20:19:39,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:39,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:39,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:39,786 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:19:39,786 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:19:39,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:39,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:19:39,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 781. [2020-02-10 20:19:39,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:39,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:19:39,808 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:19:39,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:39,808 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:19:39,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:39,808 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:19:39,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:39,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:39,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, 1, 1, 1] [2020-02-10 20:19:39,809 INFO L427 AbstractCegarLoop]: === Iteration 771 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:39,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:39,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2122681447, now seen corresponding path program 764 times [2020-02-10 20:19:39,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:39,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630309688] [2020-02-10 20:19:39,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630309688] [2020-02-10 20:19:40,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:40,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109333115] [2020-02-10 20:19:40,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:40,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:40,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:40,291 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:19:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:40,418 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 20:19:40,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:40,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:40,421 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:19:40,422 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:19:40,422 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:40,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:19:40,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 778. [2020-02-10 20:19:40,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:40,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:19:40,443 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:19:40,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:40,443 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:19:40,443 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:40,443 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:19:40,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:40,444 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:40,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, 1, 1, 1] [2020-02-10 20:19:40,445 INFO L427 AbstractCegarLoop]: === Iteration 772 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:40,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:40,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1655436479, now seen corresponding path program 765 times [2020-02-10 20:19:40,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:40,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088449783] [2020-02-10 20:19:40,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:40,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:40,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:40,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088449783] [2020-02-10 20:19:40,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:40,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:40,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495824081] [2020-02-10 20:19:40,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:40,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:40,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:40,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:40,833 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:19:40,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:40,971 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:19:40,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:40,972 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:40,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:40,975 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:40,975 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:19:40,975 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:40,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:19:40,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 20:19:40,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:19:40,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3114 transitions. [2020-02-10 20:19:40,996 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3114 transitions. Word has length 25 [2020-02-10 20:19:40,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:40,996 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3114 transitions. [2020-02-10 20:19:40,996 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:40,996 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3114 transitions. [2020-02-10 20:19:40,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:40,997 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:40,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, 1, 1, 1] [2020-02-10 20:19:40,997 INFO L427 AbstractCegarLoop]: === Iteration 773 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:40,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:40,997 INFO L82 PathProgramCache]: Analyzing trace with hash -2101675239, now seen corresponding path program 766 times [2020-02-10 20:19:40,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:40,998 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090298157] [2020-02-10 20:19:40,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090298157] [2020-02-10 20:19:41,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:41,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582811829] [2020-02-10 20:19:41,390 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:41,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:41,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:41,390 INFO L87 Difference]: Start difference. First operand 783 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:19:41,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:41,541 INFO L93 Difference]: Finished difference Result 1243 states and 4380 transitions. [2020-02-10 20:19:41,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:41,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:41,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:41,545 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:19:41,545 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:41,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:19:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:19:41,566 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:19:41,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:41,566 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:19:41,566 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:41,566 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:19:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:41,567 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:41,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, 1, 1, 1] [2020-02-10 20:19:41,567 INFO L427 AbstractCegarLoop]: === Iteration 774 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:41,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:41,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1665939583, now seen corresponding path program 767 times [2020-02-10 20:19:41,567 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:41,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169616928] [2020-02-10 20:19:41,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:41,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:41,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:41,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169616928] [2020-02-10 20:19:41,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:41,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:41,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670173353] [2020-02-10 20:19:41,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:41,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:41,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:41,963 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:19:42,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,124 INFO L93 Difference]: Finished difference Result 1236 states and 4366 transitions. [2020-02-10 20:19:42,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:42,125 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:42,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,128 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:19:42,128 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:42,128 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:42,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 781. [2020-02-10 20:19:42,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:42,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:19:42,149 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:19:42,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,149 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:19:42,149 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:42,149 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:19:42,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:42,150 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,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, 1, 1, 1] [2020-02-10 20:19:42,150 INFO L427 AbstractCegarLoop]: === Iteration 775 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,151 INFO L82 PathProgramCache]: Analyzing trace with hash 592854203, now seen corresponding path program 768 times [2020-02-10 20:19:42,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991243235] [2020-02-10 20:19:42,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:42,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991243235] [2020-02-10 20:19:42,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:42,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:42,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805964252] [2020-02-10 20:19:42,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:42,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:42,569 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:19:42,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:42,702 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 20:19:42,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:42,703 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:42,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:42,706 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:42,706 INFO L226 Difference]: Without dead ends: 1215 [2020-02-10 20:19:42,706 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:42,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2020-02-10 20:19:42,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 772. [2020-02-10 20:19:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:19:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3089 transitions. [2020-02-10 20:19:42,727 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3089 transitions. Word has length 25 [2020-02-10 20:19:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:42,727 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3089 transitions. [2020-02-10 20:19:42,728 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:42,728 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3089 transitions. [2020-02-10 20:19:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:42,729 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:42,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, 1, 1, 1] [2020-02-10 20:19:42,729 INFO L427 AbstractCegarLoop]: === Iteration 776 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:42,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash -2001748835, now seen corresponding path program 769 times [2020-02-10 20:19:42,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:42,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212142530] [2020-02-10 20:19:42,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:42,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212142530] [2020-02-10 20:19:43,108 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:43,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302825898] [2020-02-10 20:19:43,108 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:43,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:43,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:43,108 INFO L87 Difference]: Start difference. First operand 772 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:19:43,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:43,264 INFO L93 Difference]: Finished difference Result 1262 states and 4453 transitions. [2020-02-10 20:19:43,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:43,265 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:43,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:43,268 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:19:43,268 INFO L226 Difference]: Without dead ends: 1249 [2020-02-10 20:19:43,268 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:43,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1249 states. [2020-02-10 20:19:43,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1249 to 784. [2020-02-10 20:19:43,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:43,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3130 transitions. [2020-02-10 20:19:43,290 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3130 transitions. Word has length 25 [2020-02-10 20:19:43,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:43,290 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3130 transitions. [2020-02-10 20:19:43,290 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:43,290 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3130 transitions. [2020-02-10 20:19:43,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:43,291 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:43,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, 1, 1, 1] [2020-02-10 20:19:43,291 INFO L427 AbstractCegarLoop]: === Iteration 777 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:43,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:43,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1031497221, now seen corresponding path program 770 times [2020-02-10 20:19:43,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:43,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946153319] [2020-02-10 20:19:43,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:43,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:43,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:43,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946153319] [2020-02-10 20:19:43,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:43,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:43,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634033167] [2020-02-10 20:19:43,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:43,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:43,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:43,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:43,671 INFO L87 Difference]: Start difference. First operand 784 states and 3130 transitions. Second operand 10 states. [2020-02-10 20:19:43,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:43,821 INFO L93 Difference]: Finished difference Result 1264 states and 4453 transitions. [2020-02-10 20:19:43,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:43,821 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:43,824 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:19:43,824 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 20:19:43,825 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:43,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 20:19:43,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 780. [2020-02-10 20:19:43,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:43,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3119 transitions. [2020-02-10 20:19:43,846 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:43,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:43,846 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3119 transitions. [2020-02-10 20:19:43,846 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:43,846 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3119 transitions. [2020-02-10 20:19:43,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:43,847 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:43,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, 1, 1, 1] [2020-02-10 20:19:43,847 INFO L427 AbstractCegarLoop]: === Iteration 778 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:43,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:43,847 INFO L82 PathProgramCache]: Analyzing trace with hash 1850319321, now seen corresponding path program 771 times [2020-02-10 20:19:43,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:43,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887962317] [2020-02-10 20:19:43,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:44,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887962317] [2020-02-10 20:19:44,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:44,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:44,232 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618415344] [2020-02-10 20:19:44,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:44,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:44,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:44,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:44,233 INFO L87 Difference]: Start difference. First operand 780 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:44,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,372 INFO L93 Difference]: Finished difference Result 1263 states and 4451 transitions. [2020-02-10 20:19:44,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:44,372 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:44,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,375 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 20:19:44,375 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:19:44,376 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:44,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:19:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 784. [2020-02-10 20:19:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 20:19:44,397 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 20:19:44,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,397 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 20:19:44,397 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:44,397 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 20:19:44,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:44,398 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,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, 1, 1, 1] [2020-02-10 20:19:44,398 INFO L427 AbstractCegarLoop]: === Iteration 779 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1453390153, now seen corresponding path program 772 times [2020-02-10 20:19:44,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563683384] [2020-02-10 20:19:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:44,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563683384] [2020-02-10 20:19:44,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:44,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:44,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27953964] [2020-02-10 20:19:44,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:44,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:44,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:44,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:44,793 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:19:44,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:44,943 INFO L93 Difference]: Finished difference Result 1266 states and 4453 transitions. [2020-02-10 20:19:44,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:44,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:44,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:44,947 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:19:44,947 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:19:44,947 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:44,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:19:44,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 780. [2020-02-10 20:19:44,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:44,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 20:19:44,969 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 20:19:44,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:44,969 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 20:19:44,969 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:44,969 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 20:19:44,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:44,970 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:44,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, 1, 1, 1] [2020-02-10 20:19:44,970 INFO L427 AbstractCegarLoop]: === Iteration 780 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:44,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:44,971 INFO L82 PathProgramCache]: Analyzing trace with hash -367275811, now seen corresponding path program 773 times [2020-02-10 20:19:44,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:44,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203508320] [2020-02-10 20:19:44,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:44,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,356 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203508320] [2020-02-10 20:19:45,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:45,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279465621] [2020-02-10 20:19:45,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:45,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:45,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:45,357 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:19:45,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:45,491 INFO L93 Difference]: Finished difference Result 1269 states and 4461 transitions. [2020-02-10 20:19:45,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:45,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:45,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:45,494 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 20:19:45,495 INFO L226 Difference]: Without dead ends: 1254 [2020-02-10 20:19:45,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:45,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2020-02-10 20:19:45,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 786. [2020-02-10 20:19:45,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:19:45,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3126 transitions. [2020-02-10 20:19:45,517 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3126 transitions. Word has length 25 [2020-02-10 20:19:45,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:45,517 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3126 transitions. [2020-02-10 20:19:45,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3126 transitions. [2020-02-10 20:19:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:45,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:45,518 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:45,518 INFO L427 AbstractCegarLoop]: === Iteration 781 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:45,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:45,518 INFO L82 PathProgramCache]: Analyzing trace with hash -1440361191, now seen corresponding path program 774 times [2020-02-10 20:19:45,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:45,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977836822] [2020-02-10 20:19:45,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:45,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:45,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977836822] [2020-02-10 20:19:45,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:45,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:45,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202687564] [2020-02-10 20:19:45,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:45,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:45,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:45,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:45,898 INFO L87 Difference]: Start difference. First operand 786 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:19:46,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,032 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 20:19:46,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:46,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:46,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,036 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:19:46,036 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:19:46,036 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:19:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 776. [2020-02-10 20:19:46,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:19:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3104 transitions. [2020-02-10 20:19:46,058 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3104 transitions. Word has length 25 [2020-02-10 20:19:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,058 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3104 transitions. [2020-02-10 20:19:46,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3104 transitions. [2020-02-10 20:19:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:46,059 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,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, 1, 1, 1] [2020-02-10 20:19:46,059 INFO L427 AbstractCegarLoop]: === Iteration 782 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1870732735, now seen corresponding path program 775 times [2020-02-10 20:19:46,059 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327991439] [2020-02-10 20:19:46,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:46,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:46,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327991439] [2020-02-10 20:19:46,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:46,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820206175] [2020-02-10 20:19:46,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:46,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:46,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:46,447 INFO L87 Difference]: Start difference. First operand 776 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:19:46,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:46,578 INFO L93 Difference]: Finished difference Result 1259 states and 4442 transitions. [2020-02-10 20:19:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:46,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:46,582 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:19:46,582 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:19:46,583 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:46,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:19:46,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 20:19:46,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:46,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3126 transitions. [2020-02-10 20:19:46,606 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3126 transitions. Word has length 25 [2020-02-10 20:19:46,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:46,606 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3126 transitions. [2020-02-10 20:19:46,607 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:46,607 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3126 transitions. [2020-02-10 20:19:46,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:46,608 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:46,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, 1, 1, 1] [2020-02-10 20:19:46,608 INFO L427 AbstractCegarLoop]: === Iteration 783 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:46,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1453982947, now seen corresponding path program 776 times [2020-02-10 20:19:46,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:46,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768708463] [2020-02-10 20:19:46,608 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19: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 20:19:46,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768708463] [2020-02-10 20:19:46,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:46,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:46,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960087744] [2020-02-10 20:19:46,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:46,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:46,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:46,996 INFO L87 Difference]: Start difference. First operand 784 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:19:47,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:47,161 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 20:19:47,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:47,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:47,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:47,165 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:19:47,165 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:19:47,165 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:47,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:19:47,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:19:47,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:47,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3115 transitions. [2020-02-10 20:19:47,186 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3115 transitions. Word has length 25 [2020-02-10 20:19:47,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:47,186 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3115 transitions. [2020-02-10 20:19:47,186 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:47,186 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3115 transitions. [2020-02-10 20:19:47,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:47,187 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:47,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, 1, 1, 1] [2020-02-10 20:19:47,188 INFO L427 AbstractCegarLoop]: === Iteration 784 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:47,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:47,188 INFO L82 PathProgramCache]: Analyzing trace with hash -941099623, now seen corresponding path program 777 times [2020-02-10 20:19:47,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:47,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869072528] [2020-02-10 20:19:47,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:47,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:47,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:47,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869072528] [2020-02-10 20:19:47,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:47,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:47,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967540203] [2020-02-10 20:19:47,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:47,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:47,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:47,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:47,580 INFO L87 Difference]: Start difference. First operand 780 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:19:47,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:47,724 INFO L93 Difference]: Finished difference Result 1258 states and 4436 transitions. [2020-02-10 20:19:47,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:47,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:47,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:47,728 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:19:47,728 INFO L226 Difference]: Without dead ends: 1245 [2020-02-10 20:19:47,729 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2020-02-10 20:19:47,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 784. [2020-02-10 20:19:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:47,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 20:19:47,751 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 20:19:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:47,751 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 20:19:47,751 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 20:19:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:47,752 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:47,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, 1, 1, 1] [2020-02-10 20:19:47,752 INFO L427 AbstractCegarLoop]: === Iteration 785 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:47,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:47,752 INFO L82 PathProgramCache]: Analyzing trace with hash 60661303, now seen corresponding path program 778 times [2020-02-10 20:19:47,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:47,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191402103] [2020-02-10 20:19:47,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:47,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191402103] [2020-02-10 20:19:48,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:48,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795964255] [2020-02-10 20:19:48,152 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:48,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:48,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:48,153 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:19:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,296 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 20:19:48,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:48,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,300 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:19:48,300 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 20:19:48,300 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:48,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 20:19:48,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 780. [2020-02-10 20:19:48,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:48,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:19:48,321 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:19:48,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,321 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:19:48,321 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:48,322 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:19:48,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:48,323 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,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, 1, 1, 1] [2020-02-10 20:19:48,323 INFO L427 AbstractCegarLoop]: === Iteration 786 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,323 INFO L82 PathProgramCache]: Analyzing trace with hash -464165313, now seen corresponding path program 779 times [2020-02-10 20:19:48,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138434726] [2020-02-10 20:19:48,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:48,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:48,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138434726] [2020-02-10 20:19:48,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:48,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:48,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206655360] [2020-02-10 20:19:48,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:48,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:48,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:48,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:48,715 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:19:48,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:48,850 INFO L93 Difference]: Finished difference Result 1263 states and 4443 transitions. [2020-02-10 20:19:48,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:48,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:48,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:48,853 INFO L225 Difference]: With dead ends: 1263 [2020-02-10 20:19:48,853 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:19:48,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:48,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:19:48,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 20:19:48,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:19:48,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 20:19:48,875 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 20:19:48,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:48,875 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 20:19:48,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:48,875 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 20:19:48,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:48,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:48,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, 1, 1, 1] [2020-02-10 20:19:48,876 INFO L427 AbstractCegarLoop]: === Iteration 787 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:48,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:48,876 INFO L82 PathProgramCache]: Analyzing trace with hash 73690265, now seen corresponding path program 780 times [2020-02-10 20:19:48,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:48,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754217761] [2020-02-10 20:19:48,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:48,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,263 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754217761] [2020-02-10 20:19:49,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:49,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964693903] [2020-02-10 20:19:49,264 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:49,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:49,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:49,264 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:19:49,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:49,423 INFO L93 Difference]: Finished difference Result 1262 states and 4436 transitions. [2020-02-10 20:19:49,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:49,423 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:49,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:49,427 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:19:49,427 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 20:19:49,427 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:49,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 20:19:49,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 776. [2020-02-10 20:19:49,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:19:49,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 20:19:49,449 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 20:19:49,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:49,449 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 20:19:49,449 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:49,449 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 20:19:49,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:49,450 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:49,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, 1, 1, 1] [2020-02-10 20:19:49,450 INFO L427 AbstractCegarLoop]: === Iteration 788 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:49,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:49,450 INFO L82 PathProgramCache]: Analyzing trace with hash 582862143, now seen corresponding path program 781 times [2020-02-10 20:19:49,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:49,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867361030] [2020-02-10 20:19:49,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:49,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:49,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:49,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867361030] [2020-02-10 20:19:49,829 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:49,829 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:49,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29345850] [2020-02-10 20:19:49,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:49,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:49,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:49,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:49,829 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:19:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:49,974 INFO L93 Difference]: Finished difference Result 1261 states and 4442 transitions. [2020-02-10 20:19:49,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:49,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:49,977 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:19:49,978 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:19:49,978 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:19:49,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 784. [2020-02-10 20:19:49,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:49,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3122 transitions. [2020-02-10 20:19:49,999 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3122 transitions. Word has length 25 [2020-02-10 20:19:49,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:49,999 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3122 transitions. [2020-02-10 20:19:49,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:49,999 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3122 transitions. [2020-02-10 20:19:50,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:50,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,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, 1, 1, 1] [2020-02-10 20:19:50,000 INFO L427 AbstractCegarLoop]: === Iteration 789 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1574119965, now seen corresponding path program 782 times [2020-02-10 20:19:50,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035227220] [2020-02-10 20:19:50,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035227220] [2020-02-10 20:19:50,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:50,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565645142] [2020-02-10 20:19:50,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:50,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:50,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:50,381 INFO L87 Difference]: Start difference. First operand 784 states and 3122 transitions. Second operand 10 states. [2020-02-10 20:19:50,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:50,533 INFO L93 Difference]: Finished difference Result 1264 states and 4444 transitions. [2020-02-10 20:19:50,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:50,533 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:50,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:50,537 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:19:50,537 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:19:50,537 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:19:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 20:19:50,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:19:50,559 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:19:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:50,559 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:19:50,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:19:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:50,560 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:50,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, 1, 1, 1] [2020-02-10 20:19:50,560 INFO L427 AbstractCegarLoop]: === Iteration 790 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:50,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:50,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1786071075, now seen corresponding path program 783 times [2020-02-10 20:19:50,560 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:50,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803640420] [2020-02-10 20:19:50,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:50,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:50,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803640420] [2020-02-10 20:19:50,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:50,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:50,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405161569] [2020-02-10 20:19:50,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:50,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:50,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:50,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:50,964 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:19:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,104 INFO L93 Difference]: Finished difference Result 1259 states and 4434 transitions. [2020-02-10 20:19:51,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:51,104 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:51,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,108 INFO L225 Difference]: With dead ends: 1259 [2020-02-10 20:19:51,108 INFO L226 Difference]: Without dead ends: 1246 [2020-02-10 20:19:51,108 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:51,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2020-02-10 20:19:51,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 784. [2020-02-10 20:19:51,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:19:51,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3118 transitions. [2020-02-10 20:19:51,130 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3118 transitions. Word has length 25 [2020-02-10 20:19:51,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,130 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3118 transitions. [2020-02-10 20:19:51,130 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:51,130 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3118 transitions. [2020-02-10 20:19:51,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:51,131 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,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, 1, 1, 1] [2020-02-10 20:19:51,131 INFO L427 AbstractCegarLoop]: === Iteration 791 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,131 INFO L82 PathProgramCache]: Analyzing trace with hash -784310149, now seen corresponding path program 784 times [2020-02-10 20:19:51,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942949577] [2020-02-10 20:19:51,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:51,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:51,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942949577] [2020-02-10 20:19:51,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:51,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:51,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153709804] [2020-02-10 20:19:51,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:51,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:51,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:51,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:51,508 INFO L87 Difference]: Start difference. First operand 784 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:19:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:51,676 INFO L93 Difference]: Finished difference Result 1260 states and 4432 transitions. [2020-02-10 20:19:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:51,677 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:51,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:51,680 INFO L225 Difference]: With dead ends: 1260 [2020-02-10 20:19:51,680 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:19:51,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:51,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:19:51,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:19:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:19:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3107 transitions. [2020-02-10 20:19:51,702 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3107 transitions. Word has length 25 [2020-02-10 20:19:51,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:51,703 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3107 transitions. [2020-02-10 20:19:51,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:51,703 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3107 transitions. [2020-02-10 20:19:51,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:51,704 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:51,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, 1, 1, 1] [2020-02-10 20:19:51,704 INFO L427 AbstractCegarLoop]: === Iteration 792 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:51,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:51,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1731029697, now seen corresponding path program 785 times [2020-02-10 20:19:51,704 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:51,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406450273] [2020-02-10 20:19:51,704 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:51,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406450273] [2020-02-10 20:19:52,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:52,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747391436] [2020-02-10 20:19:52,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:52,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:52,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:52,078 INFO L87 Difference]: Start difference. First operand 780 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:19:52,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,240 INFO L93 Difference]: Finished difference Result 1266 states and 4445 transitions. [2020-02-10 20:19:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:52,241 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:52,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,244 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:19:52,244 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:19:52,244 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:52,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:19:52,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 785. [2020-02-10 20:19:52,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:19:52,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3116 transitions. [2020-02-10 20:19:52,266 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3116 transitions. Word has length 25 [2020-02-10 20:19:52,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,266 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3116 transitions. [2020-02-10 20:19:52,266 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:52,266 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3116 transitions. [2020-02-10 20:19:52,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:52,267 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,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, 1, 1, 1] [2020-02-10 20:19:52,267 INFO L427 AbstractCegarLoop]: === Iteration 793 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,267 INFO L82 PathProgramCache]: Analyzing trace with hash -120088739, now seen corresponding path program 786 times [2020-02-10 20:19:52,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927006629] [2020-02-10 20:19:52,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:52,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:52,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927006629] [2020-02-10 20:19:52,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:52,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:52,656 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320087967] [2020-02-10 20:19:52,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:52,656 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:52,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:52,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:52,657 INFO L87 Difference]: Start difference. First operand 785 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:19:52,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:52,827 INFO L93 Difference]: Finished difference Result 1264 states and 4436 transitions. [2020-02-10 20:19:52,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:52,827 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:52,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:52,830 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:19:52,830 INFO L226 Difference]: Without dead ends: 1241 [2020-02-10 20:19:52,830 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:52,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2020-02-10 20:19:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 776. [2020-02-10 20:19:52,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:19:52,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:19:52,851 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:19:52,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:52,852 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:19:52,852 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:52,852 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:19:52,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:52,853 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:52,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, 1, 1, 1] [2020-02-10 20:19:52,853 INFO L427 AbstractCegarLoop]: === Iteration 794 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:52,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:52,853 INFO L82 PathProgramCache]: Analyzing trace with hash 252299771, now seen corresponding path program 787 times [2020-02-10 20:19:52,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:52,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602743198] [2020-02-10 20:19:52,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:53,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:53,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602743198] [2020-02-10 20:19:53,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:53,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:53,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147626625] [2020-02-10 20:19:53,244 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:53,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:53,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:53,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:53,244 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:19:53,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:53,409 INFO L93 Difference]: Finished difference Result 1273 states and 4469 transitions. [2020-02-10 20:19:53,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:53,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:53,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:53,412 INFO L225 Difference]: With dead ends: 1273 [2020-02-10 20:19:53,412 INFO L226 Difference]: Without dead ends: 1258 [2020-02-10 20:19:53,412 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1258 states. [2020-02-10 20:19:53,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1258 to 787. [2020-02-10 20:19:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 787 states. [2020-02-10 20:19:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 787 states to 787 states and 3126 transitions. [2020-02-10 20:19:53,433 INFO L78 Accepts]: Start accepts. Automaton has 787 states and 3126 transitions. Word has length 25 [2020-02-10 20:19:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:53,433 INFO L479 AbstractCegarLoop]: Abstraction has 787 states and 3126 transitions. [2020-02-10 20:19:53,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 787 states and 3126 transitions. [2020-02-10 20:19:53,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:53,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:53,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, 1, 1, 1] [2020-02-10 20:19:53,435 INFO L427 AbstractCegarLoop]: === Iteration 795 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:53,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:53,435 INFO L82 PathProgramCache]: Analyzing trace with hash -820785609, now seen corresponding path program 788 times [2020-02-10 20:19:53,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:53,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885873874] [2020-02-10 20:19:53,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:53,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:53,828 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885873874] [2020-02-10 20:19:53,828 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:53,828 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:53,829 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520981050] [2020-02-10 20:19:53,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:53,829 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:53,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:53,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:53,829 INFO L87 Difference]: Start difference. First operand 787 states and 3126 transitions. Second operand 10 states. [2020-02-10 20:19:53,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:53,970 INFO L93 Difference]: Finished difference Result 1274 states and 4465 transitions. [2020-02-10 20:19:53,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:53,970 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:53,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:53,973 INFO L225 Difference]: With dead ends: 1274 [2020-02-10 20:19:53,974 INFO L226 Difference]: Without dead ends: 1252 [2020-02-10 20:19:53,974 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:53,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2020-02-10 20:19:53,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 781. [2020-02-10 20:19:53,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:19:53,995 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:19:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:53,995 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:19:53,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:53,995 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:19:53,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:53,996 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:53,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, 1, 1, 1] [2020-02-10 20:19:53,996 INFO L427 AbstractCegarLoop]: === Iteration 796 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:53,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:53,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1348138083, now seen corresponding path program 789 times [2020-02-10 20:19:53,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:53,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296747946] [2020-02-10 20:19:53,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:54,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296747946] [2020-02-10 20:19:54,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:54,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619577252] [2020-02-10 20:19:54,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:54,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:54,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:54,409 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:19:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:54,545 INFO L93 Difference]: Finished difference Result 1270 states and 4457 transitions. [2020-02-10 20:19:54,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:54,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:54,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:54,549 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:19:54,549 INFO L226 Difference]: Without dead ends: 1255 [2020-02-10 20:19:54,549 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:54,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2020-02-10 20:19:54,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 786. [2020-02-10 20:19:54,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:19:54,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3119 transitions. [2020-02-10 20:19:54,571 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3119 transitions. Word has length 25 [2020-02-10 20:19:54,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:54,571 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3119 transitions. [2020-02-10 20:19:54,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:54,571 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3119 transitions. [2020-02-10 20:19:54,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:54,572 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:54,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, 1, 1, 1] [2020-02-10 20:19:54,572 INFO L427 AbstractCegarLoop]: === Iteration 797 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:54,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:54,572 INFO L82 PathProgramCache]: Analyzing trace with hash -810282505, now seen corresponding path program 790 times [2020-02-10 20:19:54,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:54,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030622738] [2020-02-10 20:19:54,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:54,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 20:19:54,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030622738] [2020-02-10 20:19:54,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:54,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:54,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817501092] [2020-02-10 20:19:54,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:54,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:54,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:54,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:54,967 INFO L87 Difference]: Start difference. First operand 786 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:19:55,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:55,122 INFO L93 Difference]: Finished difference Result 1269 states and 4450 transitions. [2020-02-10 20:19:55,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:55,122 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:55,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:55,125 INFO L225 Difference]: With dead ends: 1269 [2020-02-10 20:19:55,125 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:19:55,126 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:55,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:19:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 781. [2020-02-10 20:19:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:55,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3105 transitions. [2020-02-10 20:19:55,155 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3105 transitions. Word has length 25 [2020-02-10 20:19:55,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:55,155 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3105 transitions. [2020-02-10 20:19:55,155 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:55,155 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3105 transitions. [2020-02-10 20:19:55,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:55,156 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:55,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, 1, 1, 1] [2020-02-10 20:19:55,157 INFO L427 AbstractCegarLoop]: === Iteration 798 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:55,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:55,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1327131875, now seen corresponding path program 791 times [2020-02-10 20:19:55,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:55,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312350597] [2020-02-10 20:19:55,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:55,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:55,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:55,552 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312350597] [2020-02-10 20:19:55,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:55,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:55,552 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724271030] [2020-02-10 20:19:55,553 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:55,553 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:55,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:55,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:55,553 INFO L87 Difference]: Start difference. First operand 781 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:19:55,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:55,691 INFO L93 Difference]: Finished difference Result 1272 states and 4456 transitions. [2020-02-10 20:19:55,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:55,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:55,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:55,694 INFO L225 Difference]: With dead ends: 1272 [2020-02-10 20:19:55,694 INFO L226 Difference]: Without dead ends: 1256 [2020-02-10 20:19:55,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2020-02-10 20:19:55,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 786. [2020-02-10 20:19:55,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:19:55,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3114 transitions. [2020-02-10 20:19:55,716 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3114 transitions. Word has length 25 [2020-02-10 20:19:55,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:55,716 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3114 transitions. [2020-02-10 20:19:55,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:55,716 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3114 transitions. [2020-02-10 20:19:55,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:55,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:55,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, 1, 1, 1] [2020-02-10 20:19:55,717 INFO L427 AbstractCegarLoop]: === Iteration 799 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:55,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:55,717 INFO L82 PathProgramCache]: Analyzing trace with hash 283809083, now seen corresponding path program 792 times [2020-02-10 20:19:55,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:55,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214470736] [2020-02-10 20:19:55,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:55,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:56,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:56,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214470736] [2020-02-10 20:19:56,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:56,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:56,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923612605] [2020-02-10 20:19:56,111 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:56,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:56,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:56,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:56,111 INFO L87 Difference]: Start difference. First operand 786 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:19:56,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,276 INFO L93 Difference]: Finished difference Result 1270 states and 4447 transitions. [2020-02-10 20:19:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:56,277 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,280 INFO L225 Difference]: With dead ends: 1270 [2020-02-10 20:19:56,280 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:19:56,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:56,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:19:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 772. [2020-02-10 20:19:56,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:19:56,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3086 transitions. [2020-02-10 20:19:56,301 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3086 transitions. Word has length 25 [2020-02-10 20:19:56,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,302 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3086 transitions. [2020-02-10 20:19:56,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:56,302 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3086 transitions. [2020-02-10 20:19:56,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:56,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:56,303 INFO L427 AbstractCegarLoop]: === Iteration 800 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -710356101, now seen corresponding path program 793 times [2020-02-10 20:19:56,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210219034] [2020-02-10 20:19:56,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:56,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:56,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210219034] [2020-02-10 20:19:56,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:56,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:56,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340325028] [2020-02-10 20:19:56,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:56,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:56,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:56,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:56,691 INFO L87 Difference]: Start difference. First operand 772 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:19:56,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:56,836 INFO L93 Difference]: Finished difference Result 1236 states and 4374 transitions. [2020-02-10 20:19:56,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:56,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:56,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:56,840 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:19:56,840 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:19:56,840 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:56,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:19:56,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 781. [2020-02-10 20:19:56,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:56,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3116 transitions. [2020-02-10 20:19:56,862 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3116 transitions. Word has length 25 [2020-02-10 20:19:56,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:56,862 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3116 transitions. [2020-02-10 20:19:56,862 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:56,862 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3116 transitions. [2020-02-10 20:19:56,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:56,863 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:56,863 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:19:56,863 INFO L427 AbstractCegarLoop]: === Iteration 801 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:56,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:56,863 INFO L82 PathProgramCache]: Analyzing trace with hash 270398617, now seen corresponding path program 794 times [2020-02-10 20:19:56,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:56,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930850976] [2020-02-10 20:19:56,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,257 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930850976] [2020-02-10 20:19:57,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:57,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337257044] [2020-02-10 20:19:57,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:57,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:57,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:57,258 INFO L87 Difference]: Start difference. First operand 781 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:19:57,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,430 INFO L93 Difference]: Finished difference Result 1235 states and 4369 transitions. [2020-02-10 20:19:57,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:57,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:57,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,434 INFO L225 Difference]: With dead ends: 1235 [2020-02-10 20:19:57,434 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:19:57,435 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:57,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:19:57,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:19:57,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:57,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3108 transitions. [2020-02-10 20:19:57,456 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3108 transitions. Word has length 25 [2020-02-10 20:19:57,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:57,456 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3108 transitions. [2020-02-10 20:19:57,456 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:57,456 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3108 transitions. [2020-02-10 20:19:57,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:57,457 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:57,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, 1, 1, 1] [2020-02-10 20:19:57,457 INFO L427 AbstractCegarLoop]: === Iteration 802 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:57,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:57,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1215677977, now seen corresponding path program 795 times [2020-02-10 20:19:57,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:57,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102767574] [2020-02-10 20:19:57,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:57,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:57,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:57,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102767574] [2020-02-10 20:19:57,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:57,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:57,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227415704] [2020-02-10 20:19:57,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:57,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:57,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:57,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:57,837 INFO L87 Difference]: Start difference. First operand 778 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:19:57,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:57,975 INFO L93 Difference]: Finished difference Result 1241 states and 4382 transitions. [2020-02-10 20:19:57,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:57,975 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:57,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:57,979 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:19:57,979 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:19:57,979 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:19:57,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 782. [2020-02-10 20:19:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:19:58,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3115 transitions. [2020-02-10 20:19:58,000 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3115 transitions. Word has length 25 [2020-02-10 20:19:58,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:58,000 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3115 transitions. [2020-02-10 20:19:58,000 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:58,000 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3115 transitions. [2020-02-10 20:19:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:58,001 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:58,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, 1, 1, 1] [2020-02-10 20:19:58,002 INFO L427 AbstractCegarLoop]: === Iteration 803 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2088031497, now seen corresponding path program 796 times [2020-02-10 20:19:58,002 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:58,002 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153977305] [2020-02-10 20:19:58,002 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153977305] [2020-02-10 20:19:58,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:58,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093777715] [2020-02-10 20:19:58,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:58,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:58,376 INFO L87 Difference]: Start difference. First operand 782 states and 3115 transitions. Second operand 10 states. [2020-02-10 20:19:58,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:58,513 INFO L93 Difference]: Finished difference Result 1244 states and 4384 transitions. [2020-02-10 20:19:58,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:58,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:58,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:58,517 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:19:58,517 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:19:58,517 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:58,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:19:58,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 778. [2020-02-10 20:19:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:19:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:19:58,538 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:19:58,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:58,538 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:19:58,538 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:58,539 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:19:58,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:58,539 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:58,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, 1, 1, 1] [2020-02-10 20:19:58,540 INFO L427 AbstractCegarLoop]: === Iteration 804 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:58,540 INFO L82 PathProgramCache]: Analyzing trace with hash 934620027, now seen corresponding path program 797 times [2020-02-10 20:19:58,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:58,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212985759] [2020-02-10 20:19:58,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:58,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:58,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212985759] [2020-02-10 20:19:58,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:58,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:58,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901431205] [2020-02-10 20:19:58,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:58,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:58,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:58,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:58,922 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:19:59,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,075 INFO L93 Difference]: Finished difference Result 1238 states and 4372 transitions. [2020-02-10 20:19:59,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:59,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:59,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,079 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:19:59,079 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:19:59,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:59,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:19:59,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:19:59,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:19:59,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:19:59,101 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:19:59,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,101 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:19:59,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:59,101 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:19:59,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:59,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,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, 1, 1, 1] [2020-02-10 20:19:59,102 INFO L427 AbstractCegarLoop]: === Iteration 805 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,102 INFO L82 PathProgramCache]: Analyzing trace with hash -1749406311, now seen corresponding path program 798 times [2020-02-10 20:19:59,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940773491] [2020-02-10 20:19:59,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:19:59,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:19:59,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940773491] [2020-02-10 20:19:59,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:19:59,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:19:59,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340975460] [2020-02-10 20:19:59,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:19:59,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:19:59,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:19:59,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:19:59,476 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:19:59,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:19:59,635 INFO L93 Difference]: Finished difference Result 1242 states and 4377 transitions. [2020-02-10 20:19:59,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:19:59,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:19:59,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:19:59,639 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:19:59,639 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:19:59,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:19:59,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:19:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 775. [2020-02-10 20:19:59,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:19:59,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:19:59,660 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:19:59,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:19:59,660 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:19:59,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:19:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:19:59,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:19:59,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:19:59,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, 1, 1, 1] [2020-02-10 20:19:59,662 INFO L427 AbstractCegarLoop]: === Iteration 806 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:19:59,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:19:59,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1132841827, now seen corresponding path program 799 times [2020-02-10 20:19:59,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:19:59,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467808797] [2020-02-10 20:19:59,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:19:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:00,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467808797] [2020-02-10 20:20:00,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:00,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547580807] [2020-02-10 20:20:00,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:00,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:00,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:00,043 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:20:00,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,203 INFO L93 Difference]: Finished difference Result 1234 states and 4367 transitions. [2020-02-10 20:20:00,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:00,204 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:00,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,207 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:20:00,207 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:20:00,207 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:00,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:20:00,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 781. [2020-02-10 20:20:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:00,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:20:00,229 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:20:00,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,229 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:20:00,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:00,229 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:20:00,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:00,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,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, 1, 1, 1] [2020-02-10 20:20:00,230 INFO L427 AbstractCegarLoop]: === Iteration 807 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,230 INFO L82 PathProgramCache]: Analyzing trace with hash -152087109, now seen corresponding path program 800 times [2020-02-10 20:20:00,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855136067] [2020-02-10 20:20:00,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:00,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 20:20:00,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855136067] [2020-02-10 20:20:00,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:00,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:00,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748722477] [2020-02-10 20:20:00,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:00,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:00,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:00,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:00,631 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:20:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:00,794 INFO L93 Difference]: Finished difference Result 1233 states and 4362 transitions. [2020-02-10 20:20:00,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:00,794 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:00,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:00,797 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:20:00,797 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:20:00,797 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:00,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:20:00,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:20:00,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:00,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:20:00,819 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:00,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:00,819 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:20:00,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:00,819 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:20:00,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:00,820 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:00,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, 1, 1, 1] [2020-02-10 20:20:00,820 INFO L427 AbstractCegarLoop]: === Iteration 808 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:00,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:00,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1575740967, now seen corresponding path program 801 times [2020-02-10 20:20:00,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:00,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931255012] [2020-02-10 20:20:00,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:01,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:01,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931255012] [2020-02-10 20:20:01,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:01,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040323998] [2020-02-10 20:20:01,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:01,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:01,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:01,206 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:01,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,356 INFO L93 Difference]: Finished difference Result 1237 states and 4371 transitions. [2020-02-10 20:20:01,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:01,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,360 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:20:01,360 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:20:01,360 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:20:01,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 782. [2020-02-10 20:20:01,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:20:01,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3112 transitions. [2020-02-10 20:20:01,382 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3112 transitions. Word has length 25 [2020-02-10 20:20:01,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,382 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3112 transitions. [2020-02-10 20:20:01,382 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:01,382 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3112 transitions. [2020-02-10 20:20:01,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:01,383 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,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, 1, 1, 1] [2020-02-10 20:20:01,383 INFO L427 AbstractCegarLoop]: === Iteration 809 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,384 INFO L82 PathProgramCache]: Analyzing trace with hash -573980041, now seen corresponding path program 802 times [2020-02-10 20:20:01,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957148740] [2020-02-10 20:20:01,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:01,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:01,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957148740] [2020-02-10 20:20:01,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:01,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:01,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711070404] [2020-02-10 20:20:01,778 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:01,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:01,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:01,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:01,778 INFO L87 Difference]: Start difference. First operand 782 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:20:01,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:01,927 INFO L93 Difference]: Finished difference Result 1238 states and 4369 transitions. [2020-02-10 20:20:01,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:01,927 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:01,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:01,931 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:20:01,931 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:20:01,931 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:01,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:20:01,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:20:01,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:20:01,952 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:01,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:01,953 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:20:01,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:01,953 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:20:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:01,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:01,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, 1, 1, 1] [2020-02-10 20:20:01,954 INFO L427 AbstractCegarLoop]: === Iteration 810 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:01,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:01,954 INFO L82 PathProgramCache]: Analyzing trace with hash 837730525, now seen corresponding path program 803 times [2020-02-10 20:20:01,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:01,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928993007] [2020-02-10 20:20:01,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:01,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,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 20:20:02,347 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928993007] [2020-02-10 20:20:02,347 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,347 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:02,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015796359] [2020-02-10 20:20:02,348 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:02,348 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:02,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:02,348 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:02,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:02,505 INFO L93 Difference]: Finished difference Result 1234 states and 4361 transitions. [2020-02-10 20:20:02,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:02,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:02,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:02,508 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:20:02,509 INFO L226 Difference]: Without dead ends: 1222 [2020-02-10 20:20:02,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:02,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1222 states. [2020-02-10 20:20:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1222 to 781. [2020-02-10 20:20:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:02,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:20:02,531 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:20:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:02,531 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:20:02,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:02,531 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:20:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:02,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:02,532 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:02,532 INFO L427 AbstractCegarLoop]: === Iteration 811 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:02,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -235354855, now seen corresponding path program 804 times [2020-02-10 20:20:02,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:02,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815144869] [2020-02-10 20:20:02,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:02,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:02,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815144869] [2020-02-10 20:20:02,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:02,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:02,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543448719] [2020-02-10 20:20:02,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:02,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:02,922 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:20:03,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,056 INFO L93 Difference]: Finished difference Result 1236 states and 4362 transitions. [2020-02-10 20:20:03,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:03,057 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:03,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,060 INFO L225 Difference]: With dead ends: 1236 [2020-02-10 20:20:03,060 INFO L226 Difference]: Without dead ends: 1216 [2020-02-10 20:20:03,060 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:03,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1216 states. [2020-02-10 20:20:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1216 to 775. [2020-02-10 20:20:03,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:03,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:20:03,082 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:20:03,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,082 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:20:03,082 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:03,082 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:20:03,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:03,083 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,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, 1, 1, 1] [2020-02-10 20:20:03,083 INFO L427 AbstractCegarLoop]: === Iteration 812 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,084 INFO L82 PathProgramCache]: Analyzing trace with hash 370706525, now seen corresponding path program 805 times [2020-02-10 20:20:03,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462970413] [2020-02-10 20:20:03,084 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:03,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:03,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462970413] [2020-02-10 20:20:03,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:03,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:03,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696341761] [2020-02-10 20:20:03,462 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:03,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:03,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:03,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:03,462 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:20:03,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:03,609 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 20:20:03,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:03,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:03,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:03,612 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:20:03,612 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:20:03,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:03,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:20:03,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 20:20:03,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:20:03,633 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:20:03,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:03,633 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:20:03,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:03,634 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:20:03,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:03,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:03,635 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:03,635 INFO L427 AbstractCegarLoop]: === Iteration 813 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1361964347, now seen corresponding path program 806 times [2020-02-10 20:20:03,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:03,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867664906] [2020-02-10 20:20:03,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,027 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867664906] [2020-02-10 20:20:04,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:04,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219282670] [2020-02-10 20:20:04,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:04,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:04,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:04,028 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:20:04,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,180 INFO L93 Difference]: Finished difference Result 1250 states and 4398 transitions. [2020-02-10 20:20:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:04,181 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:04,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,184 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:20:04,184 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:20:04,184 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:04,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:20:04,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 20:20:04,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:20:04,206 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,206 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:20:04,206 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:04,206 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:20:04,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:04,207 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,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, 1, 1, 1] [2020-02-10 20:20:04,207 INFO L427 AbstractCegarLoop]: === Iteration 814 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,207 INFO L82 PathProgramCache]: Analyzing trace with hash -1998226693, now seen corresponding path program 807 times [2020-02-10 20:20:04,207 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,207 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307997554] [2020-02-10 20:20:04,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:04,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307997554] [2020-02-10 20:20:04,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:04,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:04,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459283040] [2020-02-10 20:20:04,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:04,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:04,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:04,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:04,588 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:04,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:04,741 INFO L93 Difference]: Finished difference Result 1245 states and 4388 transitions. [2020-02-10 20:20:04,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:04,741 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:04,745 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:20:04,745 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:20:04,745 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:04,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:20:04,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:20:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:04,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:20:04,767 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:20:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:04,767 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:20:04,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:04,767 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:20:04,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:04,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:04,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, 1, 1, 1] [2020-02-10 20:20:04,768 INFO L427 AbstractCegarLoop]: === Iteration 815 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:04,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash -996465767, now seen corresponding path program 808 times [2020-02-10 20:20:04,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:04,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873254939] [2020-02-10 20:20:04,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873254939] [2020-02-10 20:20:05,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:05,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701079372] [2020-02-10 20:20:05,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:05,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:05,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:05,150 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:20:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:05,300 INFO L93 Difference]: Finished difference Result 1246 states and 4386 transitions. [2020-02-10 20:20:05,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:05,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:05,304 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:20:05,304 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:20:05,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:05,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:20:05,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 20:20:05,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 20:20:05,325 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 20:20:05,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:05,325 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 20:20:05,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:05,326 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 20:20:05,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:05,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:05,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, 1, 1, 1] [2020-02-10 20:20:05,327 INFO L427 AbstractCegarLoop]: === Iteration 816 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:05,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:05,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1943185315, now seen corresponding path program 809 times [2020-02-10 20:20:05,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:05,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214371624] [2020-02-10 20:20:05,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:05,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:05,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:05,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214371624] [2020-02-10 20:20:05,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:05,702 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:05,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588446793] [2020-02-10 20:20:05,703 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:05,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:05,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:05,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:05,703 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:20:05,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:05,852 INFO L93 Difference]: Finished difference Result 1252 states and 4399 transitions. [2020-02-10 20:20:05,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:05,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:05,856 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:20:05,856 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:20:05,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:05,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:20:05,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 784. [2020-02-10 20:20:05,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:20:05,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 20:20:05,877 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 20:20:05,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:05,877 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 20:20:05,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:05,877 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 20:20:05,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:05,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:05,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, 1, 1, 1] [2020-02-10 20:20:05,878 INFO L427 AbstractCegarLoop]: === Iteration 817 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:05,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:05,878 INFO L82 PathProgramCache]: Analyzing trace with hash -332244357, now seen corresponding path program 810 times [2020-02-10 20:20:05,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:05,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634062079] [2020-02-10 20:20:05,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:06,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634062079] [2020-02-10 20:20:06,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:06,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870887760] [2020-02-10 20:20:06,266 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:06,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:06,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:06,266 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:20:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,420 INFO L93 Difference]: Finished difference Result 1250 states and 4390 transitions. [2020-02-10 20:20:06,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:06,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,424 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:20:06,424 INFO L226 Difference]: Without dead ends: 1227 [2020-02-10 20:20:06,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:06,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2020-02-10 20:20:06,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 775. [2020-02-10 20:20:06,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:20:06,446 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:20:06,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,446 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:20:06,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:06,446 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:20:06,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:06,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,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, 1, 1, 1] [2020-02-10 20:20:06,447 INFO L427 AbstractCegarLoop]: === Iteration 818 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,448 INFO L82 PathProgramCache]: Analyzing trace with hash 1554195609, now seen corresponding path program 811 times [2020-02-10 20:20:06,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117046878] [2020-02-10 20:20:06,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:06,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:06,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117046878] [2020-02-10 20:20:06,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:06,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:06,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256642940] [2020-02-10 20:20:06,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:06,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:06,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:06,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:06,817 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:20:06,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:06,960 INFO L93 Difference]: Finished difference Result 1240 states and 4374 transitions. [2020-02-10 20:20:06,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:06,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:06,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:06,964 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:20:06,964 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:20:06,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:06,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:20:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 781. [2020-02-10 20:20:06,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:06,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:20:06,986 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:20:06,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:06,986 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:20:06,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:06,986 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:20:06,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:06,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:06,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, 1, 1, 1] [2020-02-10 20:20:06,987 INFO L427 AbstractCegarLoop]: === Iteration 819 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:06,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:06,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1129830729, now seen corresponding path program 812 times [2020-02-10 20:20:06,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:06,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680210883] [2020-02-10 20:20:06,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680210883] [2020-02-10 20:20:07,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:07,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337967709] [2020-02-10 20:20:07,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:07,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:07,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:07,363 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:20:07,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:07,524 INFO L93 Difference]: Finished difference Result 1244 states and 4379 transitions. [2020-02-10 20:20:07,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:07,525 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:07,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:07,528 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:20:07,528 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:20:07,528 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:07,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:20:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 778. [2020-02-10 20:20:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:07,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 20:20:07,551 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 20:20:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:07,551 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 20:20:07,551 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 20:20:07,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:07,552 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:07,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, 1, 1, 1] [2020-02-10 20:20:07,553 INFO L427 AbstractCegarLoop]: === Iteration 820 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash -46242245, now seen corresponding path program 813 times [2020-02-10 20:20:07,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:07,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020265871] [2020-02-10 20:20:07,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:07,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:07,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020265871] [2020-02-10 20:20:07,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:07,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:07,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692391989] [2020-02-10 20:20:07,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:07,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:07,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:07,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:07,925 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:20:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:08,094 INFO L93 Difference]: Finished difference Result 1238 states and 4367 transitions. [2020-02-10 20:20:08,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:08,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:08,098 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:20:08,098 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:20:08,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:08,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:20:08,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 781. [2020-02-10 20:20:08,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:08,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:20:08,119 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:08,120 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:20:08,120 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:20:08,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:08,121 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:08,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, 1, 1, 1] [2020-02-10 20:20:08,121 INFO L427 AbstractCegarLoop]: === Iteration 821 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:08,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:08,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1119327625, now seen corresponding path program 814 times [2020-02-10 20:20:08,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:08,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727997127] [2020-02-10 20:20:08,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:08,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:08,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 20:20:08,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727997127] [2020-02-10 20:20:08,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:08,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:08,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573931735] [2020-02-10 20:20:08,487 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:08,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:08,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:08,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:08,488 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:20:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:08,658 INFO L93 Difference]: Finished difference Result 1240 states and 4368 transitions. [2020-02-10 20:20:08,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:08,659 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:08,662 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:20:08,663 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:20:08,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:08,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:20:08,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 778. [2020-02-10 20:20:08,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:08,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:20:08,686 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:08,686 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:20:08,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:20:08,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:08,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:08,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:08,687 INFO L427 AbstractCegarLoop]: === Iteration 822 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:08,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash -35739141, now seen corresponding path program 815 times [2020-02-10 20:20:08,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:08,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142001592] [2020-02-10 20:20:08,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:09,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142001592] [2020-02-10 20:20:09,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:09,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:09,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413576416] [2020-02-10 20:20:09,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:09,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:09,065 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:09,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,229 INFO L93 Difference]: Finished difference Result 1248 states and 4386 transitions. [2020-02-10 20:20:09,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:09,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:09,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,233 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:20:09,233 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:20:09,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:09,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:20:09,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:20:09,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:09,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 20:20:09,254 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:09,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,254 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 20:20:09,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:09,255 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 20:20:09,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:09,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,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, 1, 1, 1] [2020-02-10 20:20:09,256 INFO L427 AbstractCegarLoop]: === Iteration 823 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1575201817, now seen corresponding path program 816 times [2020-02-10 20:20:09,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087975776] [2020-02-10 20:20:09,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:09,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:09,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087975776] [2020-02-10 20:20:09,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:09,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:09,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617866382] [2020-02-10 20:20:09,631 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:09,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:09,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:09,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:09,632 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:09,807 INFO L93 Difference]: Finished difference Result 1246 states and 4377 transitions. [2020-02-10 20:20:09,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:09,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:09,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:09,811 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:20:09,811 INFO L226 Difference]: Without dead ends: 1221 [2020-02-10 20:20:09,811 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:09,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1221 states. [2020-02-10 20:20:09,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1221 to 772. [2020-02-10 20:20:09,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 772 states. [2020-02-10 20:20:09,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 3083 transitions. [2020-02-10 20:20:09,832 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 3083 transitions. Word has length 25 [2020-02-10 20:20:09,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:09,832 INFO L479 AbstractCegarLoop]: Abstraction has 772 states and 3083 transitions. [2020-02-10 20:20:09,832 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:09,833 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 3083 transitions. [2020-02-10 20:20:09,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:09,833 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:09,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, 1, 1, 1] [2020-02-10 20:20:09,834 INFO L427 AbstractCegarLoop]: === Iteration 824 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:09,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:09,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1296926015, now seen corresponding path program 817 times [2020-02-10 20:20:09,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:09,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90963655] [2020-02-10 20:20:09,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:09,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90963655] [2020-02-10 20:20:10,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:10,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130224050] [2020-02-10 20:20:10,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:10,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:10,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:10,213 INFO L87 Difference]: Start difference. First operand 772 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:20:10,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,388 INFO L93 Difference]: Finished difference Result 1250 states and 4406 transitions. [2020-02-10 20:20:10,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:10,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:10,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,392 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:20:10,392 INFO L226 Difference]: Without dead ends: 1235 [2020-02-10 20:20:10,392 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:10,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1235 states. [2020-02-10 20:20:10,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1235 to 781. [2020-02-10 20:20:10,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:10,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3113 transitions. [2020-02-10 20:20:10,414 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3113 transitions. Word has length 25 [2020-02-10 20:20:10,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,414 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3113 transitions. [2020-02-10 20:20:10,414 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:10,414 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3113 transitions. [2020-02-10 20:20:10,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:10,415 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,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, 1, 1, 1] [2020-02-10 20:20:10,415 INFO L427 AbstractCegarLoop]: === Iteration 825 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1387100323, now seen corresponding path program 818 times [2020-02-10 20:20:10,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,415 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771128166] [2020-02-10 20:20:10,415 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:10,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:10,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771128166] [2020-02-10 20:20:10,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:10,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:10,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642450335] [2020-02-10 20:20:10,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:10,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:10,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:10,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:10,790 INFO L87 Difference]: Start difference. First operand 781 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:20:10,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:10,928 INFO L93 Difference]: Finished difference Result 1247 states and 4397 transitions. [2020-02-10 20:20:10,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:10,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:10,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:10,931 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:20:10,932 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:20:10,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:10,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:20:10,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 778. [2020-02-10 20:20:10,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:20:10,953 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:10,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:10,953 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:20:10,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:20:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:10,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:10,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, 1, 1, 1] [2020-02-10 20:20:10,955 INFO L427 AbstractCegarLoop]: === Iteration 826 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:10,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:10,955 INFO L82 PathProgramCache]: Analyzing trace with hash -303511839, now seen corresponding path program 819 times [2020-02-10 20:20:10,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:10,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754761593] [2020-02-10 20:20:10,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:10,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754761593] [2020-02-10 20:20:11,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:11,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960662348] [2020-02-10 20:20:11,336 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:11,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:11,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:11,336 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:11,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:11,471 INFO L93 Difference]: Finished difference Result 1257 states and 4420 transitions. [2020-02-10 20:20:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:11,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:11,475 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:20:11,475 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:20:11,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:11,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:20:11,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 784. [2020-02-10 20:20:11,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:20:11,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 20:20:11,496 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 20:20:11,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:11,496 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 20:20:11,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:11,496 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 20:20:11,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:11,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:11,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, 1, 1, 1] [2020-02-10 20:20:11,497 INFO L427 AbstractCegarLoop]: === Iteration 827 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:11,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:11,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1376597219, now seen corresponding path program 820 times [2020-02-10 20:20:11,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:11,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107454206] [2020-02-10 20:20:11,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:11,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:11,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:11,879 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107454206] [2020-02-10 20:20:11,879 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:11,879 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:11,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370951070] [2020-02-10 20:20:11,880 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:11,880 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:11,880 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:20:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:12,046 INFO L93 Difference]: Finished difference Result 1258 states and 4416 transitions. [2020-02-10 20:20:12,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:12,047 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:12,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:12,050 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:20:12,050 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:20:12,050 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:12,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:20:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 778. [2020-02-10 20:20:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:12,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:20:12,072 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:12,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:12,072 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:20:12,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:12,072 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:20:12,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:12,073 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:12,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, 1, 1, 1] [2020-02-10 20:20:12,073 INFO L427 AbstractCegarLoop]: === Iteration 828 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:12,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:12,073 INFO L82 PathProgramCache]: Analyzing trace with hash -293008735, now seen corresponding path program 821 times [2020-02-10 20:20:12,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:12,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505841954] [2020-02-10 20:20:12,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:12,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505841954] [2020-02-10 20:20:12,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:12,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:12,452 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949710633] [2020-02-10 20:20:12,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:12,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:12,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:12,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:12,453 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:12,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:12,592 INFO L93 Difference]: Finished difference Result 1248 states and 4396 transitions. [2020-02-10 20:20:12,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:12,592 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:12,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:12,595 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:20:12,595 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:20:12,595 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:12,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:20:12,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 781. [2020-02-10 20:20:12,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:12,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:20:12,616 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:20:12,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:12,616 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:20:12,616 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:12,616 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:20:12,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:12,617 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:12,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, 1, 1, 1] [2020-02-10 20:20:12,617 INFO L427 AbstractCegarLoop]: === Iteration 829 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:12,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:12,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1317932223, now seen corresponding path program 822 times [2020-02-10 20:20:12,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:12,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128641606] [2020-02-10 20:20:12,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,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 20:20:13,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128641606] [2020-02-10 20:20:13,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:13,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115794756] [2020-02-10 20:20:13,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:13,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:13,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:13,004 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:20:13,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,168 INFO L93 Difference]: Finished difference Result 1252 states and 4401 transitions. [2020-02-10 20:20:13,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:13,169 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:13,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,172 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:20:13,172 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:20:13,172 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:13,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:20:13,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 775. [2020-02-10 20:20:13,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:13,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:20:13,193 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:20:13,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,193 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:20:13,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:13,193 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:20:13,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:13,194 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,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, 1, 1, 1] [2020-02-10 20:20:13,195 INFO L427 AbstractCegarLoop]: === Iteration 830 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,195 INFO L82 PathProgramCache]: Analyzing trace with hash -1072007203, now seen corresponding path program 823 times [2020-02-10 20:20:13,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203028562] [2020-02-10 20:20:13,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:13,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203028562] [2020-02-10 20:20:13,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:13,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:13,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221709282] [2020-02-10 20:20:13,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:13,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:13,590 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:20:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:13,745 INFO L93 Difference]: Finished difference Result 1247 states and 4396 transitions. [2020-02-10 20:20:13,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:13,746 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:13,749 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:20:13,749 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:20:13,749 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:13,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:20:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:20:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:20:13,773 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:20:13,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:13,773 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:20:13,773 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:13,773 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:20:13,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:13,774 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:13,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, 1, 1, 1] [2020-02-10 20:20:13,775 INFO L427 AbstractCegarLoop]: === Iteration 831 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:13,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:13,775 INFO L82 PathProgramCache]: Analyzing trace with hash 538933755, now seen corresponding path program 824 times [2020-02-10 20:20:13,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:13,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692952] [2020-02-10 20:20:13,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:14,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692952] [2020-02-10 20:20:14,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:14,161 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238196123] [2020-02-10 20:20:14,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:14,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:14,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:14,161 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:20:14,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,310 INFO L93 Difference]: Finished difference Result 1244 states and 4387 transitions. [2020-02-10 20:20:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:14,311 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:14,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,314 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:20:14,314 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:20:14,314 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:20:14,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 20:20:14,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:14,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:20:14,335 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,335 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:20:14,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:20:14,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:14,336 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,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, 1, 1, 1] [2020-02-10 20:20:14,336 INFO L427 AbstractCegarLoop]: === Iteration 832 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,337 INFO L82 PathProgramCache]: Analyzing trace with hash 22084385, now seen corresponding path program 825 times [2020-02-10 20:20:14,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,337 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397971253] [2020-02-10 20:20:14,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:14,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:14,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397971253] [2020-02-10 20:20:14,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:14,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:14,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516549513] [2020-02-10 20:20:14,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:14,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:14,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:14,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:14,713 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:14,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:14,855 INFO L93 Difference]: Finished difference Result 1251 states and 4403 transitions. [2020-02-10 20:20:14,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:14,856 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:14,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:14,859 INFO L225 Difference]: With dead ends: 1251 [2020-02-10 20:20:14,859 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:20:14,859 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:14,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:20:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 783. [2020-02-10 20:20:14,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:14,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 20:20:14,881 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 20:20:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:14,881 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 20:20:14,881 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:14,881 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 20:20:14,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:14,882 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:14,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, 1, 1, 1] [2020-02-10 20:20:14,882 INFO L427 AbstractCegarLoop]: === Iteration 833 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:14,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:14,882 INFO L82 PathProgramCache]: Analyzing trace with hash 559939963, now seen corresponding path program 826 times [2020-02-10 20:20:14,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:14,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432509707] [2020-02-10 20:20:14,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:15,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432509707] [2020-02-10 20:20:15,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:15,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:15,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76016671] [2020-02-10 20:20:15,261 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:15,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:15,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:15,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:15,262 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:20:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:15,398 INFO L93 Difference]: Finished difference Result 1250 states and 4396 transitions. [2020-02-10 20:20:15,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:15,399 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:15,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:15,402 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:20:15,402 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:20:15,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:15,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:20:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 20:20:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:15,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3099 transitions. [2020-02-10 20:20:15,424 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3099 transitions. Word has length 25 [2020-02-10 20:20:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,424 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3099 transitions. [2020-02-10 20:20:15,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3099 transitions. [2020-02-10 20:20:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:15,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,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, 1, 1, 1] [2020-02-10 20:20:15,425 INFO L427 AbstractCegarLoop]: === Iteration 834 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,425 INFO L82 PathProgramCache]: Analyzing trace with hash 32587489, now seen corresponding path program 827 times [2020-02-10 20:20:15,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977198093] [2020-02-10 20:20:15,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:15,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 20:20:15,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977198093] [2020-02-10 20:20:15,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:15,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:15,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338388536] [2020-02-10 20:20:15,799 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:15,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:15,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:15,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:15,800 INFO L87 Difference]: Start difference. First operand 778 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:20:15,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:15,943 INFO L93 Difference]: Finished difference Result 1243 states and 4382 transitions. [2020-02-10 20:20:15,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:15,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:15,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:15,946 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:20:15,946 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:20:15,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:15,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:20:15,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 781. [2020-02-10 20:20:15,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:15,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:20:15,967 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:15,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:15,967 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:20:15,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:15,968 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:20:15,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:15,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:15,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, 1, 1, 1] [2020-02-10 20:20:15,969 INFO L427 AbstractCegarLoop]: === Iteration 835 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:15,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:15,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1040497891, now seen corresponding path program 828 times [2020-02-10 20:20:15,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:15,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741114569] [2020-02-10 20:20:15,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:16,348 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741114569] [2020-02-10 20:20:16,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:16,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117958110] [2020-02-10 20:20:16,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:16,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:16,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:16,349 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:20:16,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:16,491 INFO L93 Difference]: Finished difference Result 1245 states and 4383 transitions. [2020-02-10 20:20:16,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:16,492 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:16,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:16,495 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:20:16,495 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:20:16,496 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:16,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:20:16,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 20:20:16,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:20:16,517 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:20:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:16,517 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:20:16,517 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:20:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:16,518 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:16,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, 1, 1, 1] [2020-02-10 20:20:16,518 INFO L427 AbstractCegarLoop]: === Iteration 836 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:16,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:16,518 INFO L82 PathProgramCache]: Analyzing trace with hash -746410979, now seen corresponding path program 829 times [2020-02-10 20:20:16,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:16,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874618994] [2020-02-10 20:20:16,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:16,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:16,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:16,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874618994] [2020-02-10 20:20:16,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:16,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:16,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260342963] [2020-02-10 20:20:16,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:16,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:16,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:16,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:16,901 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:20:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:17,099 INFO L93 Difference]: Finished difference Result 1265 states and 4441 transitions. [2020-02-10 20:20:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:17,099 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:17,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:17,103 INFO L225 Difference]: With dead ends: 1265 [2020-02-10 20:20:17,103 INFO L226 Difference]: Without dead ends: 1250 [2020-02-10 20:20:17,103 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:17,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1250 states. [2020-02-10 20:20:17,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1250 to 786. [2020-02-10 20:20:17,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:20:17,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3121 transitions. [2020-02-10 20:20:17,124 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3121 transitions. Word has length 25 [2020-02-10 20:20:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:17,124 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3121 transitions. [2020-02-10 20:20:17,124 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:17,124 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3121 transitions. [2020-02-10 20:20:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:17,125 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:17,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, 1, 1, 1] [2020-02-10 20:20:17,125 INFO L427 AbstractCegarLoop]: === Iteration 837 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:17,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:17,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1819496359, now seen corresponding path program 830 times [2020-02-10 20:20:17,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:17,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048617939] [2020-02-10 20:20:17,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:17,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:17,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048617939] [2020-02-10 20:20:17,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:17,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:17,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672682341] [2020-02-10 20:20:17,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:17,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:17,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:17,528 INFO L87 Difference]: Start difference. First operand 786 states and 3121 transitions. Second operand 10 states. [2020-02-10 20:20:17,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:17,715 INFO L93 Difference]: Finished difference Result 1266 states and 4437 transitions. [2020-02-10 20:20:17,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:17,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:17,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:17,718 INFO L225 Difference]: With dead ends: 1266 [2020-02-10 20:20:17,718 INFO L226 Difference]: Without dead ends: 1244 [2020-02-10 20:20:17,719 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:17,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2020-02-10 20:20:17,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 780. [2020-02-10 20:20:17,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:17,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:20:17,739 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:17,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:17,740 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:20:17,740 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:17,740 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:20:17,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:17,741 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:17,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, 1, 1, 1] [2020-02-10 20:20:17,741 INFO L427 AbstractCegarLoop]: === Iteration 838 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:17,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:17,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1948118463, now seen corresponding path program 831 times [2020-02-10 20:20:17,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:17,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854564706] [2020-02-10 20:20:17,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:17,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:18,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:18,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854564706] [2020-02-10 20:20:18,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:18,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:18,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192222881] [2020-02-10 20:20:18,130 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:18,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:18,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:18,131 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:18,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,280 INFO L93 Difference]: Finished difference Result 1262 states and 4429 transitions. [2020-02-10 20:20:18,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:18,281 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:18,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,284 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:20:18,284 INFO L226 Difference]: Without dead ends: 1247 [2020-02-10 20:20:18,284 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1247 states. [2020-02-10 20:20:18,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1247 to 785. [2020-02-10 20:20:18,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:20:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3114 transitions. [2020-02-10 20:20:18,306 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3114 transitions. Word has length 25 [2020-02-10 20:20:18,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,307 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3114 transitions. [2020-02-10 20:20:18,307 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3114 transitions. [2020-02-10 20:20:18,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:18,308 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,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, 1, 1, 1] [2020-02-10 20:20:18,308 INFO L427 AbstractCegarLoop]: === Iteration 839 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1808993255, now seen corresponding path program 832 times [2020-02-10 20:20:18,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917598997] [2020-02-10 20:20:18,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:18,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:18,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917598997] [2020-02-10 20:20:18,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:18,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:18,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663793089] [2020-02-10 20:20:18,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:18,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:18,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:18,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:18,691 INFO L87 Difference]: Start difference. First operand 785 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:20:18,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:18,882 INFO L93 Difference]: Finished difference Result 1261 states and 4422 transitions. [2020-02-10 20:20:18,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:18,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:18,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:18,885 INFO L225 Difference]: With dead ends: 1261 [2020-02-10 20:20:18,885 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:20:18,885 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:18,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:20:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 780. [2020-02-10 20:20:18,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:18,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:20:18,906 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:20:18,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:18,907 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:20:18,907 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:18,907 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:20:18,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:18,908 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:18,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, 1, 1, 1] [2020-02-10 20:20:18,908 INFO L427 AbstractCegarLoop]: === Iteration 840 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:18,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:18,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1969124671, now seen corresponding path program 833 times [2020-02-10 20:20:18,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:18,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665469272] [2020-02-10 20:20:18,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:18,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665469272] [2020-02-10 20:20:19,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:19,299 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714650891] [2020-02-10 20:20:19,299 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:19,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:19,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:19,299 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:20:19,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:19,461 INFO L93 Difference]: Finished difference Result 1264 states and 4428 transitions. [2020-02-10 20:20:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:19,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:19,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:19,465 INFO L225 Difference]: With dead ends: 1264 [2020-02-10 20:20:19,465 INFO L226 Difference]: Without dead ends: 1248 [2020-02-10 20:20:19,465 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:19,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2020-02-10 20:20:19,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 785. [2020-02-10 20:20:19,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:20:19,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3109 transitions. [2020-02-10 20:20:19,487 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3109 transitions. Word has length 25 [2020-02-10 20:20:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:19,487 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3109 transitions. [2020-02-10 20:20:19,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:19,487 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3109 transitions. [2020-02-10 20:20:19,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:19,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:19,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, 1, 1, 1] [2020-02-10 20:20:19,488 INFO L427 AbstractCegarLoop]: === Iteration 841 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:19,489 INFO L82 PathProgramCache]: Analyzing trace with hash -714901667, now seen corresponding path program 834 times [2020-02-10 20:20:19,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:19,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53149925] [2020-02-10 20:20:19,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:19,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:19,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:19,865 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53149925] [2020-02-10 20:20:19,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:19,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:19,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956375629] [2020-02-10 20:20:19,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:19,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:19,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:19,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:19,866 INFO L87 Difference]: Start difference. First operand 785 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:20:20,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:20,059 INFO L93 Difference]: Finished difference Result 1262 states and 4419 transitions. [2020-02-10 20:20:20,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:20,060 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:20,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:20,063 INFO L225 Difference]: With dead ends: 1262 [2020-02-10 20:20:20,063 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:20:20,063 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:20,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:20:20,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 775. [2020-02-10 20:20:20,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:20,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3088 transitions. [2020-02-10 20:20:20,084 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3088 transitions. Word has length 25 [2020-02-10 20:20:20,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:20,085 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3088 transitions. [2020-02-10 20:20:20,085 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:20,085 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3088 transitions. [2020-02-10 20:20:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:20,086 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:20,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, 1, 1, 1] [2020-02-10 20:20:20,086 INFO L427 AbstractCegarLoop]: === Iteration 842 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1190126203, now seen corresponding path program 835 times [2020-02-10 20:20:20,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:20,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591883213] [2020-02-10 20:20:20,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:20,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:20,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:20,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591883213] [2020-02-10 20:20:20,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:20,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:20,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248333933] [2020-02-10 20:20:20,448 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:20,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:20,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:20,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:20,449 INFO L87 Difference]: Start difference. First operand 775 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:20:20,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:20,644 INFO L93 Difference]: Finished difference Result 1246 states and 4388 transitions. [2020-02-10 20:20:20,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:20,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:20,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:20,648 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:20:20,648 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:20:20,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:20,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:20:20,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 781. [2020-02-10 20:20:20,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:20,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:20:20,670 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:20,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:20,670 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:20:20,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:20,670 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:20:20,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:20,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:20,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, 1, 1, 1] [2020-02-10 20:20:20,671 INFO L427 AbstractCegarLoop]: === Iteration 843 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:20,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:20,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1493900135, now seen corresponding path program 836 times [2020-02-10 20:20:20,671 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:20,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479963174] [2020-02-10 20:20:20,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,039 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479963174] [2020-02-10 20:20:21,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:21,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71888010] [2020-02-10 20:20:21,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:21,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:21,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:21,040 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:20:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,222 INFO L93 Difference]: Finished difference Result 1250 states and 4393 transitions. [2020-02-10 20:20:21,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:21,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,225 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:20:21,226 INFO L226 Difference]: Without dead ends: 1231 [2020-02-10 20:20:21,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1231 states. [2020-02-10 20:20:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1231 to 778. [2020-02-10 20:20:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:20:21,247 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:21,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,247 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:20:21,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:21,247 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:20:21,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:21,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,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, 1, 1, 1] [2020-02-10 20:20:21,248 INFO L427 AbstractCegarLoop]: === Iteration 844 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,248 INFO L82 PathProgramCache]: Analyzing trace with hash -410311651, now seen corresponding path program 837 times [2020-02-10 20:20:21,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454166886] [2020-02-10 20:20:21,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:21,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:21,633 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454166886] [2020-02-10 20:20:21,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:21,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:21,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862170273] [2020-02-10 20:20:21,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:21,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:21,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:21,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:21,634 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:21,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:21,824 INFO L93 Difference]: Finished difference Result 1244 states and 4381 transitions. [2020-02-10 20:20:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:21,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:21,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:21,828 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:20:21,828 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:20:21,828 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:21,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:20:21,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 781. [2020-02-10 20:20:21,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:21,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3101 transitions. [2020-02-10 20:20:21,849 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3101 transitions. Word has length 25 [2020-02-10 20:20:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:21,849 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3101 transitions. [2020-02-10 20:20:21,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:21,850 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3101 transitions. [2020-02-10 20:20:21,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:21,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:21,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, 1, 1, 1] [2020-02-10 20:20:21,851 INFO L427 AbstractCegarLoop]: === Iteration 845 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:21,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:21,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1483397031, now seen corresponding path program 838 times [2020-02-10 20:20:21,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:21,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952527296] [2020-02-10 20:20:21,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:21,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,224 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952527296] [2020-02-10 20:20:22,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:22,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019573998] [2020-02-10 20:20:22,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:22,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:22,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:22,225 INFO L87 Difference]: Start difference. First operand 781 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:20:22,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:22,415 INFO L93 Difference]: Finished difference Result 1246 states and 4382 transitions. [2020-02-10 20:20:22,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:22,415 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:22,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:22,418 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:20:22,418 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:20:22,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:22,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:20:22,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 778. [2020-02-10 20:20:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:22,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 20:20:22,440 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 20:20:22,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:22,440 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 20:20:22,440 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:22,440 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 20:20:22,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:22,441 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:22,441 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:22,441 INFO L427 AbstractCegarLoop]: === Iteration 846 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:22,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:22,441 INFO L82 PathProgramCache]: Analyzing trace with hash -399808547, now seen corresponding path program 839 times [2020-02-10 20:20:22,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:22,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344689848] [2020-02-10 20:20:22,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:22,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:22,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344689848] [2020-02-10 20:20:22,820 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:22,820 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:22,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052654502] [2020-02-10 20:20:22,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:22,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:22,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:22,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:22,821 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:20:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,007 INFO L93 Difference]: Finished difference Result 1254 states and 4400 transitions. [2020-02-10 20:20:23,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:23,007 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,010 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:20:23,010 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:20:23,011 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:23,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:20:23,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 783. [2020-02-10 20:20:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:23,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 20:20:23,032 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:23,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,032 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 20:20:23,032 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:23,032 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 20:20:23,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:23,033 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:23,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, 1, 1, 1] [2020-02-10 20:20:23,034 INFO L427 AbstractCegarLoop]: === Iteration 847 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1211132411, now seen corresponding path program 840 times [2020-02-10 20:20:23,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623902711] [2020-02-10 20:20:23,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:23,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:23,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623902711] [2020-02-10 20:20:23,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:23,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:23,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962030628] [2020-02-10 20:20:23,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:23,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:23,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:23,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:23,402 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:23,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:23,600 INFO L93 Difference]: Finished difference Result 1252 states and 4391 transitions. [2020-02-10 20:20:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:23,600 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:23,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:23,604 INFO L225 Difference]: With dead ends: 1252 [2020-02-10 20:20:23,604 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:20:23,604 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:23,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:20:23,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 769. [2020-02-10 20:20:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:20:23,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3076 transitions. [2020-02-10 20:20:23,625 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3076 transitions. Word has length 25 [2020-02-10 20:20:23,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:23,626 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3076 transitions. [2020-02-10 20:20:23,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:23,626 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3076 transitions. [2020-02-10 20:20:23,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:23,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:23,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:23,627 INFO L427 AbstractCegarLoop]: === Iteration 848 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:23,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:23,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1423698301, now seen corresponding path program 841 times [2020-02-10 20:20:23,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:23,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298788686] [2020-02-10 20:20:23,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:23,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:23,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:23,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298788686] [2020-02-10 20:20:23,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:23,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:23,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11722955] [2020-02-10 20:20:23,988 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:23,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:23,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:23,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:23,989 INFO L87 Difference]: Start difference. First operand 769 states and 3076 transitions. Second operand 10 states. [2020-02-10 20:20:24,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:24,190 INFO L93 Difference]: Finished difference Result 1213 states and 4289 transitions. [2020-02-10 20:20:24,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:24,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:24,193 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:20:24,193 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:20:24,193 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:24,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:20:24,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 781. [2020-02-10 20:20:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:24,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3119 transitions. [2020-02-10 20:20:24,214 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3119 transitions. Word has length 25 [2020-02-10 20:20:24,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:24,215 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3119 transitions. [2020-02-10 20:20:24,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:24,215 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3119 transitions. [2020-02-10 20:20:24,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:24,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:24,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, 1, 1, 1] [2020-02-10 20:20:24,216 INFO L427 AbstractCegarLoop]: === Iteration 849 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:24,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:24,216 INFO L82 PathProgramCache]: Analyzing trace with hash -453446687, now seen corresponding path program 842 times [2020-02-10 20:20:24,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:24,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696010379] [2020-02-10 20:20:24,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:24,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:24,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:24,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696010379] [2020-02-10 20:20:24,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:24,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:24,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198393374] [2020-02-10 20:20:24,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:24,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:24,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:24,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:24,580 INFO L87 Difference]: Start difference. First operand 781 states and 3119 transitions. Second operand 10 states. [2020-02-10 20:20:24,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:24,736 INFO L93 Difference]: Finished difference Result 1215 states and 4289 transitions. [2020-02-10 20:20:24,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:24,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:24,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:24,739 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:20:24,739 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:20:24,740 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:24,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:20:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:20:24,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3109 transitions. [2020-02-10 20:20:24,761 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3109 transitions. Word has length 25 [2020-02-10 20:20:24,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:24,761 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3109 transitions. [2020-02-10 20:20:24,761 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:24,761 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3109 transitions. [2020-02-10 20:20:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:24,762 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:24,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, 1, 1, 1] [2020-02-10 20:20:24,762 INFO L427 AbstractCegarLoop]: === Iteration 850 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:24,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 502335777, now seen corresponding path program 843 times [2020-02-10 20:20:24,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:24,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462057344] [2020-02-10 20:20:24,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:24,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462057344] [2020-02-10 20:20:25,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:25,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108779556] [2020-02-10 20:20:25,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:25,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:25,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:25,133 INFO L87 Difference]: Start difference. First operand 777 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:20:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,327 INFO L93 Difference]: Finished difference Result 1209 states and 4277 transitions. [2020-02-10 20:20:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:25,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,331 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:20:25,331 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:20:25,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:25,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:20:25,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:20:25,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:25,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3114 transitions. [2020-02-10 20:20:25,351 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3114 transitions. Word has length 25 [2020-02-10 20:20:25,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,352 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3114 transitions. [2020-02-10 20:20:25,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:25,352 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3114 transitions. [2020-02-10 20:20:25,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:25,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,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, 1, 1, 1] [2020-02-10 20:20:25,353 INFO L427 AbstractCegarLoop]: === Iteration 851 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1483090495, now seen corresponding path program 844 times [2020-02-10 20:20:25,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088275708] [2020-02-10 20:20:25,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:25,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:25,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088275708] [2020-02-10 20:20:25,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:25,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:25,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639614676] [2020-02-10 20:20:25,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:25,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:25,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:25,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:25,719 INFO L87 Difference]: Start difference. First operand 780 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:20:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:25,917 INFO L93 Difference]: Finished difference Result 1208 states and 4272 transitions. [2020-02-10 20:20:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:25,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:25,921 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:20:25,921 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:20:25,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:20:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:20:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3106 transitions. [2020-02-10 20:20:25,942 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3106 transitions. Word has length 25 [2020-02-10 20:20:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:25,942 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3106 transitions. [2020-02-10 20:20:25,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3106 transitions. [2020-02-10 20:20:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:25,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:25,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, 1, 1, 1] [2020-02-10 20:20:25,944 INFO L427 AbstractCegarLoop]: === Iteration 852 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:25,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:25,944 INFO L82 PathProgramCache]: Analyzing trace with hash -114821501, now seen corresponding path program 845 times [2020-02-10 20:20:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:25,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641303590] [2020-02-10 20:20:25,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641303590] [2020-02-10 20:20:26,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:26,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529111056] [2020-02-10 20:20:26,314 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:26,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:26,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:26,314 INFO L87 Difference]: Start difference. First operand 777 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:20:26,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:26,466 INFO L93 Difference]: Finished difference Result 1213 states and 4282 transitions. [2020-02-10 20:20:26,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:26,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:26,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:26,469 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:20:26,470 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:20:26,470 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:26,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:20:26,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 20:20:26,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:26,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:20:26,490 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:20:26,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:26,491 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:20:26,491 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:26,491 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:20:26,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:26,492 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:26,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, 1, 1, 1] [2020-02-10 20:20:26,492 INFO L427 AbstractCegarLoop]: === Iteration 853 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:26,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:26,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1496119457, now seen corresponding path program 846 times [2020-02-10 20:20:26,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:26,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162405777] [2020-02-10 20:20:26,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:26,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:26,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162405777] [2020-02-10 20:20:26,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:26,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:26,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686936383] [2020-02-10 20:20:26,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:26,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:26,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:26,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:26,864 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:20:27,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:27,014 INFO L93 Difference]: Finished difference Result 1210 states and 4273 transitions. [2020-02-10 20:20:27,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:27,015 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:27,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:27,018 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:20:27,018 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:20:27,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:27,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:20:27,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 774. [2020-02-10 20:20:27,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:20:27,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3098 transitions. [2020-02-10 20:20:27,040 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3098 transitions. Word has length 25 [2020-02-10 20:20:27,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,040 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3098 transitions. [2020-02-10 20:20:27,040 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:27,040 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3098 transitions. [2020-02-10 20:20:27,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:27,041 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,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, 1, 1, 1] [2020-02-10 20:20:27,041 INFO L427 AbstractCegarLoop]: === Iteration 854 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1846184027, now seen corresponding path program 847 times [2020-02-10 20:20:27,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733061098] [2020-02-10 20:20:27,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733061098] [2020-02-10 20:20:27,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:27,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784615206] [2020-02-10 20:20:27,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:27,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:27,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:27,407 INFO L87 Difference]: Start difference. First operand 774 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:20:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:27,576 INFO L93 Difference]: Finished difference Result 1222 states and 4310 transitions. [2020-02-10 20:20:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:27,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:27,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:27,580 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:20:27,580 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:20:27,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:27,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:20:27,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 20:20:27,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:20:27,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3120 transitions. [2020-02-10 20:20:27,601 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3120 transitions. Word has length 25 [2020-02-10 20:20:27,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:27,602 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3120 transitions. [2020-02-10 20:20:27,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:27,602 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3120 transitions. [2020-02-10 20:20:27,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:27,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:27,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, 1, 1, 1] [2020-02-10 20:20:27,603 INFO L427 AbstractCegarLoop]: === Iteration 855 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:27,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:27,603 INFO L82 PathProgramCache]: Analyzing trace with hash -875932413, now seen corresponding path program 848 times [2020-02-10 20:20:27,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:27,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578316060] [2020-02-10 20:20:27,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:27,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:27,959 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578316060] [2020-02-10 20:20:27,960 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:27,960 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:27,960 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595454055] [2020-02-10 20:20:27,960 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:27,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:27,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:27,960 INFO L87 Difference]: Start difference. First operand 782 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:20:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,111 INFO L93 Difference]: Finished difference Result 1224 states and 4310 transitions. [2020-02-10 20:20:28,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:28,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:28,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,115 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:20:28,115 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:20:28,115 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:28,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:20:28,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 778. [2020-02-10 20:20:28,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:28,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3109 transitions. [2020-02-10 20:20:28,136 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3109 transitions. Word has length 25 [2020-02-10 20:20:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,136 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3109 transitions. [2020-02-10 20:20:28,136 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3109 transitions. [2020-02-10 20:20:28,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:28,137 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,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, 1, 1, 1] [2020-02-10 20:20:28,137 INFO L427 AbstractCegarLoop]: === Iteration 856 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2005884129, now seen corresponding path program 849 times [2020-02-10 20:20:28,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437253730] [2020-02-10 20:20:28,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:28,502 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437253730] [2020-02-10 20:20:28,502 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:28,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:28,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131978403] [2020-02-10 20:20:28,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:28,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:28,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:28,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:28,503 INFO L87 Difference]: Start difference. First operand 778 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:20:28,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:28,694 INFO L93 Difference]: Finished difference Result 1223 states and 4308 transitions. [2020-02-10 20:20:28,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:28,695 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:28,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:28,698 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:20:28,698 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:20:28,698 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:28,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:20:28,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 782. [2020-02-10 20:20:28,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:20:28,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3116 transitions. [2020-02-10 20:20:28,720 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3116 transitions. Word has length 25 [2020-02-10 20:20:28,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:28,720 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3116 transitions. [2020-02-10 20:20:28,720 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:28,720 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3116 transitions. [2020-02-10 20:20:28,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:28,721 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:28,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, 1, 1, 1] [2020-02-10 20:20:28,721 INFO L427 AbstractCegarLoop]: === Iteration 857 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:28,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:28,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1297825345, now seen corresponding path program 850 times [2020-02-10 20:20:28,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:28,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694238770] [2020-02-10 20:20:28,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:28,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694238770] [2020-02-10 20:20:29,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:29,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985504720] [2020-02-10 20:20:29,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:29,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:29,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:29,085 INFO L87 Difference]: Start difference. First operand 782 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:20:29,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,279 INFO L93 Difference]: Finished difference Result 1226 states and 4310 transitions. [2020-02-10 20:20:29,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:29,280 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:29,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,283 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:20:29,283 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:20:29,283 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:29,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:20:29,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 778. [2020-02-10 20:20:29,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:29,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3105 transitions. [2020-02-10 20:20:29,305 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:29,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,305 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3105 transitions. [2020-02-10 20:20:29,305 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:29,305 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3105 transitions. [2020-02-10 20:20:29,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:29,306 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,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, 1, 1, 1] [2020-02-10 20:20:29,306 INFO L427 AbstractCegarLoop]: === Iteration 858 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,307 INFO L82 PathProgramCache]: Analyzing trace with hash -211711003, now seen corresponding path program 851 times [2020-02-10 20:20:29,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772984546] [2020-02-10 20:20:29,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:29,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:29,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772984546] [2020-02-10 20:20:29,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:29,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:29,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905599619] [2020-02-10 20:20:29,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:29,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:29,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:29,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:29,673 INFO L87 Difference]: Start difference. First operand 778 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:29,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:29,823 INFO L93 Difference]: Finished difference Result 1229 states and 4318 transitions. [2020-02-10 20:20:29,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:29,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:29,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:29,827 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 20:20:29,827 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:20:29,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:29,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:20:29,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 784. [2020-02-10 20:20:29,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:20:29,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3116 transitions. [2020-02-10 20:20:29,849 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3116 transitions. Word has length 25 [2020-02-10 20:20:29,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:29,849 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3116 transitions. [2020-02-10 20:20:29,849 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:29,849 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3116 transitions. [2020-02-10 20:20:29,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:29,850 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:29,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, 1, 1, 1] [2020-02-10 20:20:29,850 INFO L427 AbstractCegarLoop]: === Iteration 859 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:29,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:29,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1284796383, now seen corresponding path program 852 times [2020-02-10 20:20:29,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:29,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146457201] [2020-02-10 20:20:29,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146457201] [2020-02-10 20:20:30,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:30,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352817107] [2020-02-10 20:20:30,220 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:30,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:30,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:30,220 INFO L87 Difference]: Start difference. First operand 784 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:20:30,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,357 INFO L93 Difference]: Finished difference Result 1230 states and 4314 transitions. [2020-02-10 20:20:30,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:30,357 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:30,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,360 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:20:30,361 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:20:30,361 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:30,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:20:30,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 774. [2020-02-10 20:20:30,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:20:30,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3095 transitions. [2020-02-10 20:20:30,383 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3095 transitions. Word has length 25 [2020-02-10 20:20:30,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:30,383 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3095 transitions. [2020-02-10 20:20:30,383 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:30,383 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3095 transitions. [2020-02-10 20:20:30,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:30,384 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:30,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, 1, 1, 1] [2020-02-10 20:20:30,384 INFO L427 AbstractCegarLoop]: === Iteration 860 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:30,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:30,385 INFO L82 PathProgramCache]: Analyzing trace with hash -342635675, now seen corresponding path program 853 times [2020-02-10 20:20:30,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:30,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383208255] [2020-02-10 20:20:30,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:30,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:30,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383208255] [2020-02-10 20:20:30,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:30,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:30,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417886998] [2020-02-10 20:20:30,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:30,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:30,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:30,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:30,762 INFO L87 Difference]: Start difference. First operand 774 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:20:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:30,905 INFO L93 Difference]: Finished difference Result 1210 states and 4276 transitions. [2020-02-10 20:20:30,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:30,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:30,909 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:20:30,909 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:20:30,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:30,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:20:30,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 780. [2020-02-10 20:20:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:30,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:20:30,946 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:20:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:30,946 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:20:30,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:20:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:30,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:30,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, 1, 1, 1] [2020-02-10 20:20:30,948 INFO L427 AbstractCegarLoop]: === Iteration 861 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:30,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:30,948 INFO L82 PathProgramCache]: Analyzing trace with hash 638119043, now seen corresponding path program 854 times [2020-02-10 20:20:30,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:30,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24747049] [2020-02-10 20:20:30,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:30,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24747049] [2020-02-10 20:20:31,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:31,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720360191] [2020-02-10 20:20:31,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:31,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:31,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:31,321 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:20:31,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:31,483 INFO L93 Difference]: Finished difference Result 1209 states and 4271 transitions. [2020-02-10 20:20:31,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:31,484 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:31,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:31,487 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:20:31,487 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:20:31,487 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:31,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:20:31,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:20:31,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:31,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:20:31,509 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:20:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:31,509 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:20:31,509 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:20:31,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:31,510 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:31,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, 1, 1, 1] [2020-02-10 20:20:31,510 INFO L427 AbstractCegarLoop]: === Iteration 862 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:31,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1583398403, now seen corresponding path program 855 times [2020-02-10 20:20:31,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:31,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226292827] [2020-02-10 20:20:31,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:31,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226292827] [2020-02-10 20:20:31,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:31,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:31,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953958877] [2020-02-10 20:20:31,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:31,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:31,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:31,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:31,879 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:20:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,010 INFO L93 Difference]: Finished difference Result 1215 states and 4284 transitions. [2020-02-10 20:20:32,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:32,011 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,014 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:20:32,014 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:20:32,014 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:20:32,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 20:20:32,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:32,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:20:32,036 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:20:32,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,036 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:20:32,036 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:32,036 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:20:32,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:32,037 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,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, 1, 1, 1] [2020-02-10 20:20:32,037 INFO L427 AbstractCegarLoop]: === Iteration 863 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1720311071, now seen corresponding path program 856 times [2020-02-10 20:20:32,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190724402] [2020-02-10 20:20:32,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:32,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:32,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190724402] [2020-02-10 20:20:32,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:32,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:32,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891691179] [2020-02-10 20:20:32,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:32,414 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:32,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:32,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:32,414 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:20:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:32,550 INFO L93 Difference]: Finished difference Result 1218 states and 4286 transitions. [2020-02-10 20:20:32,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:32,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:32,553 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:20:32,553 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:20:32,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:20:32,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:20:32,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:32,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:20:32,574 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:20:32,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:32,575 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:20:32,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:32,575 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:20:32,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:32,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:32,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, 1, 1, 1] [2020-02-10 20:20:32,576 INFO L427 AbstractCegarLoop]: === Iteration 864 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:32,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:32,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1302340453, now seen corresponding path program 857 times [2020-02-10 20:20:32,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:32,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058344047] [2020-02-10 20:20:32,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:32,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:32,951 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058344047] [2020-02-10 20:20:32,951 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:32,951 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:32,951 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751809877] [2020-02-10 20:20:32,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:32,951 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:32,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:32,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:32,952 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:20:33,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:33,084 INFO L93 Difference]: Finished difference Result 1212 states and 4274 transitions. [2020-02-10 20:20:33,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:33,084 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:33,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:33,087 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:20:33,087 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:20:33,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:20:33,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 780. [2020-02-10 20:20:33,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:33,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:20:33,108 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:20:33,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:33,109 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:20:33,109 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:33,109 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:20:33,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:33,110 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:33,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, 1, 1, 1] [2020-02-10 20:20:33,110 INFO L427 AbstractCegarLoop]: === Iteration 865 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:33,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1381685885, now seen corresponding path program 858 times [2020-02-10 20:20:33,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:33,110 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950733540] [2020-02-10 20:20:33,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:33,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950733540] [2020-02-10 20:20:33,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:33,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:33,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512990772] [2020-02-10 20:20:33,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:33,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:33,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:33,483 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:20:33,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:33,620 INFO L93 Difference]: Finished difference Result 1216 states and 4279 transitions. [2020-02-10 20:20:33,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:33,621 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:33,624 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:20:33,624 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:20:33,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:33,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:20:33,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 774. [2020-02-10 20:20:33,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:20:33,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 20:20:33,646 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 20:20:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:33,646 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 20:20:33,646 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:33,646 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 20:20:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:33,647 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:33,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, 1, 1, 1] [2020-02-10 20:20:33,647 INFO L427 AbstractCegarLoop]: === Iteration 866 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:33,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:33,647 INFO L82 PathProgramCache]: Analyzing trace with hash -998794271, now seen corresponding path program 859 times [2020-02-10 20:20:33,647 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:33,647 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040530100] [2020-02-10 20:20:33,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:33,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:34,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:34,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040530100] [2020-02-10 20:20:34,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:34,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:34,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472933916] [2020-02-10 20:20:34,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:34,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:34,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:34,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:34,022 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:20:34,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,159 INFO L93 Difference]: Finished difference Result 1218 states and 4291 transitions. [2020-02-10 20:20:34,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:34,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:34,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,162 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:20:34,163 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:20:34,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:34,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:20:34,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 780. [2020-02-10 20:20:34,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:34,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 20:20:34,184 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 20:20:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,185 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 20:20:34,185 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 20:20:34,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:34,186 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,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, 1, 1, 1] [2020-02-10 20:20:34,186 INFO L427 AbstractCegarLoop]: === Iteration 867 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,186 INFO L82 PathProgramCache]: Analyzing trace with hash 612146687, now seen corresponding path program 860 times [2020-02-10 20:20:34,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846309689] [2020-02-10 20:20:34,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:34,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:34,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846309689] [2020-02-10 20:20:34,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:34,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:34,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161915204] [2020-02-10 20:20:34,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:34,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:34,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:34,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:34,571 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:20:34,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:34,700 INFO L93 Difference]: Finished difference Result 1215 states and 4282 transitions. [2020-02-10 20:20:34,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:34,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:34,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:34,704 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:20:34,704 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:20:34,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:34,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:20:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 777. [2020-02-10 20:20:34,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:34,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:20:34,726 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:20:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:34,726 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:20:34,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:20:34,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:34,727 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:34,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, 1, 1, 1] [2020-02-10 20:20:34,727 INFO L427 AbstractCegarLoop]: === Iteration 868 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:34,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:34,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1695735171, now seen corresponding path program 861 times [2020-02-10 20:20:34,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:34,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611566402] [2020-02-10 20:20:34,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611566402] [2020-02-10 20:20:35,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:35,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950931974] [2020-02-10 20:20:35,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:35,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:35,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:35,097 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:20:35,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,227 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 20:20:35,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:35,227 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:35,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,230 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 20:20:35,231 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:20:35,231 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:35,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:20:35,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 783. [2020-02-10 20:20:35,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:35,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3111 transitions. [2020-02-10 20:20:35,252 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3111 transitions. Word has length 25 [2020-02-10 20:20:35,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,252 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3111 transitions. [2020-02-10 20:20:35,252 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:35,252 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3111 transitions. [2020-02-10 20:20:35,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:35,253 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,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, 1, 1, 1] [2020-02-10 20:20:35,253 INFO L427 AbstractCegarLoop]: === Iteration 869 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,254 INFO L82 PathProgramCache]: Analyzing trace with hash 622649791, now seen corresponding path program 862 times [2020-02-10 20:20:35,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245372971] [2020-02-10 20:20:35,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:35,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:35,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245372971] [2020-02-10 20:20:35,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:35,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:35,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154897470] [2020-02-10 20:20:35,629 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:35,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:35,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:35,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:35,629 INFO L87 Difference]: Start difference. First operand 783 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:20:35,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:35,766 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:20:35,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:35,766 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:35,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:35,770 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:20:35,770 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:20:35,770 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:35,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:20:35,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:20:35,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:35,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:20:35,791 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:20:35,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:35,791 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:20:35,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:35,791 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:20:35,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:35,792 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:35,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, 1, 1, 1] [2020-02-10 20:20:35,792 INFO L427 AbstractCegarLoop]: === Iteration 870 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:35,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:35,793 INFO L82 PathProgramCache]: Analyzing trace with hash 1706238275, now seen corresponding path program 863 times [2020-02-10 20:20:35,793 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:35,793 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578826717] [2020-02-10 20:20:35,793 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:35,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,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 20:20:36,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578826717] [2020-02-10 20:20:36,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:36,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968210491] [2020-02-10 20:20:36,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:36,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:36,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:36,166 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:20:36,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,306 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:20:36,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:36,307 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,310 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:20:36,310 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:20:36,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:36,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:20:36,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 20:20:36,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:36,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:20:36,332 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:36,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,332 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:20:36,332 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:36,332 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:20:36,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:36,333 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,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, 1, 1, 1] [2020-02-10 20:20:36,333 INFO L427 AbstractCegarLoop]: === Iteration 871 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,334 INFO L82 PathProgramCache]: Analyzing trace with hash -977788063, now seen corresponding path program 864 times [2020-02-10 20:20:36,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303644987] [2020-02-10 20:20:36,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:36,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:36,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303644987] [2020-02-10 20:20:36,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:36,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:36,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394390445] [2020-02-10 20:20:36,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:36,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:36,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:36,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:36,713 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:36,849 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 20:20:36,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:36,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:36,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:36,852 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:20:36,852 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:20:36,853 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:20:36,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 771. [2020-02-10 20:20:36,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:20:36,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3085 transitions. [2020-02-10 20:20:36,875 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3085 transitions. Word has length 25 [2020-02-10 20:20:36,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:36,875 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3085 transitions. [2020-02-10 20:20:36,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:36,875 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3085 transitions. [2020-02-10 20:20:36,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:36,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:36,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, 1, 1, 1] [2020-02-10 20:20:36,876 INFO L427 AbstractCegarLoop]: === Iteration 872 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:36,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:36,877 INFO L82 PathProgramCache]: Analyzing trace with hash -2060165155, now seen corresponding path program 865 times [2020-02-10 20:20:36,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:36,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567157477] [2020-02-10 20:20:36,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567157477] [2020-02-10 20:20:37,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:37,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209568658] [2020-02-10 20:20:37,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:37,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:37,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:37,244 INFO L87 Difference]: Start difference. First operand 771 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:20:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,380 INFO L93 Difference]: Finished difference Result 1196 states and 4235 transitions. [2020-02-10 20:20:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:37,380 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:37,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,383 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:20:37,383 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:20:37,383 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:37,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:20:37,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 780. [2020-02-10 20:20:37,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:20:37,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:20:37,405 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:20:37,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:37,405 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:20:37,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:37,406 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:20:37,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:37,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:37,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, 1, 1, 1] [2020-02-10 20:20:37,407 INFO L427 AbstractCegarLoop]: === Iteration 873 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:37,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:37,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1089913541, now seen corresponding path program 866 times [2020-02-10 20:20:37,407 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:37,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522232597] [2020-02-10 20:20:37,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:37,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:37,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522232597] [2020-02-10 20:20:37,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:37,772 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:37,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845559814] [2020-02-10 20:20:37,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:37,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:37,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:37,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:37,772 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:20:37,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:37,922 INFO L93 Difference]: Finished difference Result 1198 states and 4235 transitions. [2020-02-10 20:20:37,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:37,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:37,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:37,925 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:20:37,925 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:20:37,925 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:37,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:20:37,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 20:20:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:20:37,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3102 transitions. [2020-02-10 20:20:37,946 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:37,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:37,946 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3102 transitions. [2020-02-10 20:20:37,946 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:37,946 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3102 transitions. [2020-02-10 20:20:37,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:37,947 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:37,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, 1, 1, 1] [2020-02-10 20:20:37,947 INFO L427 AbstractCegarLoop]: === Iteration 874 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:37,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:37,947 INFO L82 PathProgramCache]: Analyzing trace with hash -134131077, now seen corresponding path program 867 times [2020-02-10 20:20:37,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:37,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001371112] [2020-02-10 20:20:37,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:37,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:38,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:38,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001371112] [2020-02-10 20:20:38,317 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:38,317 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:38,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344343769] [2020-02-10 20:20:38,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:38,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:38,318 INFO L87 Difference]: Start difference. First operand 776 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:38,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:38,452 INFO L93 Difference]: Finished difference Result 1192 states and 4223 transitions. [2020-02-10 20:20:38,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:38,452 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:38,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:38,456 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:20:38,456 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:20:38,456 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:20:38,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:20:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:38,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3107 transitions. [2020-02-10 20:20:38,477 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3107 transitions. Word has length 25 [2020-02-10 20:20:38,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:38,478 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3107 transitions. [2020-02-10 20:20:38,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:38,478 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3107 transitions. [2020-02-10 20:20:38,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:38,479 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:38,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, 1, 1, 1] [2020-02-10 20:20:38,479 INFO L427 AbstractCegarLoop]: === Iteration 875 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:38,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:38,479 INFO L82 PathProgramCache]: Analyzing trace with hash 846623641, now seen corresponding path program 868 times [2020-02-10 20:20:38,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:38,479 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030259688] [2020-02-10 20:20:38,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:38,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:38,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030259688] [2020-02-10 20:20:38,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:38,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:38,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073508633] [2020-02-10 20:20:38,852 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:38,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:38,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:38,852 INFO L87 Difference]: Start difference. First operand 779 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:20:39,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,012 INFO L93 Difference]: Finished difference Result 1191 states and 4218 transitions. [2020-02-10 20:20:39,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:39,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:39,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,015 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:20:39,016 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:20:39,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:39,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:20:39,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:20:39,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:20:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3099 transitions. [2020-02-10 20:20:39,037 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3099 transitions. Word has length 25 [2020-02-10 20:20:39,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,037 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3099 transitions. [2020-02-10 20:20:39,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:39,038 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3099 transitions. [2020-02-10 20:20:39,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:39,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:39,039 INFO L427 AbstractCegarLoop]: === Iteration 876 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,039 INFO L82 PathProgramCache]: Analyzing trace with hash -751288355, now seen corresponding path program 869 times [2020-02-10 20:20:39,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153277417] [2020-02-10 20:20:39,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:39,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153277417] [2020-02-10 20:20:39,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:39,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706505515] [2020-02-10 20:20:39,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:39,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:39,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:39,402 INFO L87 Difference]: Start difference. First operand 776 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:20:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:39,537 INFO L93 Difference]: Finished difference Result 1196 states and 4228 transitions. [2020-02-10 20:20:39,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:39,538 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:39,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:39,541 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:20:39,541 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:20:39,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:20:39,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:20:39,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:39,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:20:39,563 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:39,563 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:20:39,563 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:20:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:39,564 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:39,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, 1, 1, 1] [2020-02-10 20:20:39,565 INFO L427 AbstractCegarLoop]: === Iteration 877 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:39,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:39,565 INFO L82 PathProgramCache]: Analyzing trace with hash 859652603, now seen corresponding path program 870 times [2020-02-10 20:20:39,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:39,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942991338] [2020-02-10 20:20:39,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:39,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:39,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 20:20:39,937 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942991338] [2020-02-10 20:20:39,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:39,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:39,937 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791582703] [2020-02-10 20:20:39,937 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:39,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:39,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:39,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:39,937 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:20:40,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,087 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 20:20:40,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:40,087 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:40,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:40,090 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:20:40,090 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:20:40,091 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:40,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:20:40,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 20:20:40,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:40,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3092 transitions. [2020-02-10 20:20:40,112 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3092 transitions. Word has length 25 [2020-02-10 20:20:40,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:40,112 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3092 transitions. [2020-02-10 20:20:40,112 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:40,112 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3092 transitions. [2020-02-10 20:20:40,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:40,113 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:40,113 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:40,113 INFO L427 AbstractCegarLoop]: === Iteration 878 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:40,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:40,113 INFO L82 PathProgramCache]: Analyzing trace with hash 544859237, now seen corresponding path program 871 times [2020-02-10 20:20:40,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:40,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13833786] [2020-02-10 20:20:40,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:40,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:40,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13833786] [2020-02-10 20:20:40,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:40,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:40,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574021801] [2020-02-10 20:20:40,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:40,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:40,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:40,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:40,474 INFO L87 Difference]: Start difference. First operand 773 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:20:40,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:40,628 INFO L93 Difference]: Finished difference Result 1192 states and 4221 transitions. [2020-02-10 20:20:40,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:40,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:40,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:40,632 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:20:40,632 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:20:40,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:40,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:20:40,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:20:40,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:40,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 20:20:40,654 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 20:20:40,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:40,654 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 20:20:40,654 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:40,654 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 20:20:40,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:40,655 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:40,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, 1, 1, 1] [2020-02-10 20:20:40,655 INFO L427 AbstractCegarLoop]: === Iteration 879 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:40,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:40,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1515110851, now seen corresponding path program 872 times [2020-02-10 20:20:40,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:40,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105928183] [2020-02-10 20:20:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:40,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:41,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105928183] [2020-02-10 20:20:41,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:41,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:41,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535312741] [2020-02-10 20:20:41,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:41,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:41,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:41,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:41,012 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:20:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,146 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 20:20:41,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:41,147 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:41,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,150 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:20:41,150 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:20:41,150 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:41,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:20:41,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:20:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3097 transitions. [2020-02-10 20:20:41,171 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3097 transitions. Word has length 25 [2020-02-10 20:20:41,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,171 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3097 transitions. [2020-02-10 20:20:41,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:41,171 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3097 transitions. [2020-02-10 20:20:41,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:41,172 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,172 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:41,172 INFO L427 AbstractCegarLoop]: === Iteration 880 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1585095035, now seen corresponding path program 873 times [2020-02-10 20:20:41,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947087878] [2020-02-10 20:20:41,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:41,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:41,528 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947087878] [2020-02-10 20:20:41,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:41,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:41,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033463616] [2020-02-10 20:20:41,528 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:41,528 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:41,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:41,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:41,528 INFO L87 Difference]: Start difference. First operand 775 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:20:41,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:41,662 INFO L93 Difference]: Finished difference Result 1186 states and 4205 transitions. [2020-02-10 20:20:41,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:41,663 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:41,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:41,666 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:20:41,666 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:20:41,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:20:41,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:20:41,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:20:41,687 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:20:41,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:41,687 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:20:41,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:41,687 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:20:41,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:41,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:41,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:41,688 INFO L427 AbstractCegarLoop]: === Iteration 881 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:41,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:41,689 INFO L82 PathProgramCache]: Analyzing trace with hash -1687105127, now seen corresponding path program 874 times [2020-02-10 20:20:41,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:41,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064136279] [2020-02-10 20:20:41,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:41,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064136279] [2020-02-10 20:20:42,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:42,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618871676] [2020-02-10 20:20:42,043 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:42,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:42,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:42,043 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:20:42,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,184 INFO L93 Difference]: Finished difference Result 1184 states and 4199 transitions. [2020-02-10 20:20:42,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:42,184 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:42,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,187 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:20:42,188 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:20:42,188 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:42,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:20:42,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:20:42,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:20:42,208 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:20:42,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,208 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:20:42,208 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:42,208 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:20:42,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:42,209 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,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, 1, 1, 1] [2020-02-10 20:20:42,210 INFO L427 AbstractCegarLoop]: === Iteration 882 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1138846363, now seen corresponding path program 875 times [2020-02-10 20:20:42,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541379539] [2020-02-10 20:20:42,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:42,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:42,567 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541379539] [2020-02-10 20:20:42,567 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:42,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:42,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585328764] [2020-02-10 20:20:42,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:42,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:42,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:42,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:42,568 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:20:42,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:42,698 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 20:20:42,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:42,698 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:42,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:42,702 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:20:42,702 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:20:42,702 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:20:42,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:20:42,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:42,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:20:42,722 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:20:42,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:42,723 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:20:42,723 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:42,723 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:20:42,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:42,724 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:42,724 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:42,724 INFO L427 AbstractCegarLoop]: === Iteration 883 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:42,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:42,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1674076165, now seen corresponding path program 876 times [2020-02-10 20:20:42,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:42,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871031986] [2020-02-10 20:20:42,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:43,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871031986] [2020-02-10 20:20:43,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:43,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475606561] [2020-02-10 20:20:43,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:43,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:43,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:43,092 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:20:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,234 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 20:20:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:43,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,238 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:20:43,238 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:20:43,238 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:43,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:20:43,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:20:43,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:43,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:20:43,259 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:20:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,259 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:20:43,259 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:20:43,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:43,260 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,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, 1, 1, 1] [2020-02-10 20:20:43,261 INFO L427 AbstractCegarLoop]: === Iteration 884 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2048407589, now seen corresponding path program 877 times [2020-02-10 20:20:43,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598291359] [2020-02-10 20:20:43,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:43,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 20:20:43,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598291359] [2020-02-10 20:20:43,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:43,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:43,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408768385] [2020-02-10 20:20:43,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:43,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:43,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:43,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:43,633 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:20:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:43,776 INFO L93 Difference]: Finished difference Result 1184 states and 4201 transitions. [2020-02-10 20:20:43,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:43,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:43,780 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:20:43,780 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:20:43,780 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:43,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:20:43,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 778. [2020-02-10 20:20:43,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:43,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3102 transitions. [2020-02-10 20:20:43,801 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:43,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:43,802 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3102 transitions. [2020-02-10 20:20:43,802 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:43,802 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3102 transitions. [2020-02-10 20:20:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:43,803 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:43,803 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:43,803 INFO L427 AbstractCegarLoop]: === Iteration 885 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1265804989, now seen corresponding path program 878 times [2020-02-10 20:20:43,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:43,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280356831] [2020-02-10 20:20:43,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280356831] [2020-02-10 20:20:44,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:44,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891223603] [2020-02-10 20:20:44,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:44,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:44,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:44,180 INFO L87 Difference]: Start difference. First operand 778 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:44,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,326 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 20:20:44,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:44,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:44,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,329 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:20:44,329 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:20:44,330 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:20:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:20:44,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:20:44,350 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:20:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,351 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:20:44,351 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:20:44,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:44,352 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,352 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:44,352 INFO L427 AbstractCegarLoop]: === Iteration 886 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1162609309, now seen corresponding path program 879 times [2020-02-10 20:20:44,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297491346] [2020-02-10 20:20:44,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:44,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:44,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297491346] [2020-02-10 20:20:44,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:44,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:44,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745487707] [2020-02-10 20:20:44,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:44,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:44,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:44,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:44,727 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:20:44,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:44,866 INFO L93 Difference]: Finished difference Result 1182 states and 4194 transitions. [2020-02-10 20:20:44,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:44,866 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:44,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:44,870 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:20:44,870 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:20:44,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:44,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:20:44,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:20:44,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:44,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:20:44,905 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:20:44,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:44,906 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:20:44,906 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:20:44,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:44,907 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:44,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, 1, 1, 1] [2020-02-10 20:20:44,907 INFO L427 AbstractCegarLoop]: === Iteration 887 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:44,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:44,907 INFO L82 PathProgramCache]: Analyzing trace with hash -2109590853, now seen corresponding path program 880 times [2020-02-10 20:20:44,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:44,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213624317] [2020-02-10 20:20:44,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213624317] [2020-02-10 20:20:45,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:45,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599398521] [2020-02-10 20:20:45,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:45,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:45,275 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:20:45,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,414 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:20:45,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:45,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:45,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,417 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:20:45,418 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:20:45,418 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:45,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:20:45,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:20:45,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:45,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:20:45,438 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:20:45,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,439 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:20:45,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:45,439 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:20:45,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:45,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,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, 1, 1, 1] [2020-02-10 20:20:45,440 INFO L427 AbstractCegarLoop]: === Iteration 888 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,440 INFO L82 PathProgramCache]: Analyzing trace with hash 375205093, now seen corresponding path program 881 times [2020-02-10 20:20:45,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325277211] [2020-02-10 20:20:45,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:45,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:45,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325277211] [2020-02-10 20:20:45,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:45,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:45,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966078337] [2020-02-10 20:20:45,811 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:45,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:45,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:45,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:45,811 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:20:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:45,954 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:20:45,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:45,954 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:45,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:45,957 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:20:45,958 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:20:45,958 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:20:45,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:20:45,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:45,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:20:45,979 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:45,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:45,979 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:20:45,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:45,979 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:20:45,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:45,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:45,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, 1, 1, 1] [2020-02-10 20:20:45,980 INFO L427 AbstractCegarLoop]: === Iteration 889 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:45,980 INFO L82 PathProgramCache]: Analyzing trace with hash -1770965667, now seen corresponding path program 882 times [2020-02-10 20:20:45,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:45,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191889849] [2020-02-10 20:20:45,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:45,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:46,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:46,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191889849] [2020-02-10 20:20:46,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:46,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:46,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491759150] [2020-02-10 20:20:46,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:46,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:46,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:46,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:46,355 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:46,499 INFO L93 Difference]: Finished difference Result 1179 states and 4184 transitions. [2020-02-10 20:20:46,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:46,500 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:46,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:46,503 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:20:46,503 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:20:46,503 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:46,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:20:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 773. [2020-02-10 20:20:46,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:20:46,524 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:20:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:46,524 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:20:46,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:20:46,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:46,525 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:46,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, 1, 1, 1] [2020-02-10 20:20:46,525 INFO L427 AbstractCegarLoop]: === Iteration 890 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:46,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:46,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1419583365, now seen corresponding path program 883 times [2020-02-10 20:20:46,526 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:46,526 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613602355] [2020-02-10 20:20:46,526 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:46,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:46,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613602355] [2020-02-10 20:20:46,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:46,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:46,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888097908] [2020-02-10 20:20:46,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:46,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:46,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:46,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:46,889 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:20:47,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,026 INFO L93 Difference]: Finished difference Result 1190 states and 4211 transitions. [2020-02-10 20:20:47,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:47,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:47,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,029 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:20:47,029 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:20:47,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:47,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:20:47,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 778. [2020-02-10 20:20:47,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:20:47,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:20:47,050 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:20:47,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,050 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:20:47,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:47,050 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:20:47,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:47,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:47,052 INFO L427 AbstractCegarLoop]: === Iteration 891 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,052 INFO L82 PathProgramCache]: Analyzing trace with hash 191357593, now seen corresponding path program 884 times [2020-02-10 20:20:47,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166667692] [2020-02-10 20:20:47,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166667692] [2020-02-10 20:20:47,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:47,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167702328] [2020-02-10 20:20:47,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:47,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:47,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:47,419 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:20:47,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:47,575 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:20:47,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:47,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:47,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:47,579 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:20:47,579 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:20:47,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:20:47,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 20:20:47,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:20:47,601 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:20:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:47,601 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:20:47,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:20:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:47,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:47,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:47,602 INFO L427 AbstractCegarLoop]: === Iteration 892 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:47,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:47,602 INFO L82 PathProgramCache]: Analyzing trace with hash 768599811, now seen corresponding path program 885 times [2020-02-10 20:20:47,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:47,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439731480] [2020-02-10 20:20:47,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:47,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439731480] [2020-02-10 20:20:47,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:47,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:47,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120273447] [2020-02-10 20:20:47,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:47,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:47,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:47,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:47,966 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:20:48,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:48,102 INFO L93 Difference]: Finished difference Result 1188 states and 4204 transitions. [2020-02-10 20:20:48,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:48,103 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:48,106 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:20:48,106 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:20:48,106 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:48,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:20:48,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:20:48,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:48,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:20:48,127 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:48,127 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:20:48,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:48,127 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:20:48,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:48,128 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:48,128 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:48,129 INFO L427 AbstractCegarLoop]: === Iteration 893 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:48,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:48,129 INFO L82 PathProgramCache]: Analyzing trace with hash 233370009, now seen corresponding path program 886 times [2020-02-10 20:20:48,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:48,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223653540] [2020-02-10 20:20:48,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:48,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:48,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223653540] [2020-02-10 20:20:48,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:48,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:48,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766576991] [2020-02-10 20:20:48,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:48,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:48,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:48,512 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:48,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:48,654 INFO L93 Difference]: Finished difference Result 1184 states and 4194 transitions. [2020-02-10 20:20:48,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:48,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:48,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:48,657 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:20:48,657 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:20:48,657 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:48,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:20:48,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:20:48,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:48,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:20:48,678 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:20:48,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:48,678 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:20:48,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:48,678 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:20:48,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:48,679 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:48,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, 1, 1, 1] [2020-02-10 20:20:48,679 INFO L427 AbstractCegarLoop]: === Iteration 894 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:48,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:48,679 INFO L82 PathProgramCache]: Analyzing trace with hash 779102915, now seen corresponding path program 887 times [2020-02-10 20:20:48,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:48,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249652377] [2020-02-10 20:20:48,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,058 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249652377] [2020-02-10 20:20:49,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:49,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278175279] [2020-02-10 20:20:49,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:49,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:49,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:49,059 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:20:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,197 INFO L93 Difference]: Finished difference Result 1182 states and 4190 transitions. [2020-02-10 20:20:49,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:49,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:49,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,201 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:20:49,201 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:20:49,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:49,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:20:49,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:20:49,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:20:49,222 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:20:49,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,222 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:20:49,222 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:49,222 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:20:49,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:49,223 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,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, 1, 1, 1] [2020-02-10 20:20:49,223 INFO L427 AbstractCegarLoop]: === Iteration 895 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,223 INFO L82 PathProgramCache]: Analyzing trace with hash -1367067845, now seen corresponding path program 888 times [2020-02-10 20:20:49,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073198931] [2020-02-10 20:20:49,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:49,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:49,604 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073198931] [2020-02-10 20:20:49,604 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:49,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:49,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696534325] [2020-02-10 20:20:49,604 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:49,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:49,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:49,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:49,605 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:20:49,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:49,751 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:20:49,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:49,751 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:49,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:49,754 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:20:49,755 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:20:49,755 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:49,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:20:49,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 771. [2020-02-10 20:20:49,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:20:49,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 20:20:49,776 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 20:20:49,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:49,776 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 20:20:49,776 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:49,776 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 20:20:49,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:49,777 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:49,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, 1, 1, 1] [2020-02-10 20:20:49,777 INFO L427 AbstractCegarLoop]: === Iteration 896 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:49,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:49,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1600160797, now seen corresponding path program 889 times [2020-02-10 20:20:49,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:49,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948703858] [2020-02-10 20:20:49,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:50,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 20:20:50,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948703858] [2020-02-10 20:20:50,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:50,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121836867] [2020-02-10 20:20:50,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:50,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:50,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:50,127 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:20:50,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:50,276 INFO L93 Difference]: Finished difference Result 1214 states and 4281 transitions. [2020-02-10 20:20:50,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:50,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:50,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:50,280 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:20:50,280 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:20:50,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:50,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:20:50,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 781. [2020-02-10 20:20:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3114 transitions. [2020-02-10 20:20:50,301 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3114 transitions. Word has length 25 [2020-02-10 20:20:50,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:50,301 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3114 transitions. [2020-02-10 20:20:50,301 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3114 transitions. [2020-02-10 20:20:50,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:50,302 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:50,302 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:50,302 INFO L427 AbstractCegarLoop]: === Iteration 897 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:50,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:50,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1724554885, now seen corresponding path program 890 times [2020-02-10 20:20:50,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:50,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669224315] [2020-02-10 20:20:50,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:50,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20: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 20:20:50,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669224315] [2020-02-10 20:20:50,661 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:50,661 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:50,661 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939648343] [2020-02-10 20:20:50,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:50,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:50,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:50,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:50,662 INFO L87 Difference]: Start difference. First operand 781 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:20:50,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:50,826 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:20:50,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:50,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:50,829 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:20:50,829 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:20:50,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:50,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:20:50,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 777. [2020-02-10 20:20:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:50,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:20:50,850 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:20:50,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:50,850 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:20:50,851 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:50,851 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:20:50,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:50,852 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:50,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, 1, 1, 1] [2020-02-10 20:20:50,852 INFO L427 AbstractCegarLoop]: === Iteration 898 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:50,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1157261657, now seen corresponding path program 891 times [2020-02-10 20:20:50,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:50,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198803834] [2020-02-10 20:20:50,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:50,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:51,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:51,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198803834] [2020-02-10 20:20:51,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:51,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:51,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595056390] [2020-02-10 20:20:51,201 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:51,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:51,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:51,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:51,202 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:20:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,333 INFO L93 Difference]: Finished difference Result 1215 states and 4279 transitions. [2020-02-10 20:20:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:51,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,337 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:20:51,337 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:20:51,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:20:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 781. [2020-02-10 20:20:51,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:20:51,358 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:20:51,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,358 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:20:51,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:51,358 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:20:51,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:51,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,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, 1, 1, 1] [2020-02-10 20:20:51,360 INFO L427 AbstractCegarLoop]: === Iteration 899 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,360 INFO L82 PathProgramCache]: Analyzing trace with hash -2146447817, now seen corresponding path program 892 times [2020-02-10 20:20:51,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108236220] [2020-02-10 20:20:51,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:51,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:51,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108236220] [2020-02-10 20:20:51,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:51,711 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:51,711 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400712695] [2020-02-10 20:20:51,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:51,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:51,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:51,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:51,711 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:20:51,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:51,853 INFO L93 Difference]: Finished difference Result 1218 states and 4281 transitions. [2020-02-10 20:20:51,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:51,853 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:51,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:51,856 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:20:51,856 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:20:51,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:51,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:20:51,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:20:51,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:51,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 20:20:51,877 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 20:20:51,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:51,877 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 20:20:51,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:51,877 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 20:20:51,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:51,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:51,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, 1, 1, 1] [2020-02-10 20:20:51,879 INFO L427 AbstractCegarLoop]: === Iteration 900 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:51,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:51,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1060333475, now seen corresponding path program 893 times [2020-02-10 20:20:51,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:51,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777803705] [2020-02-10 20:20:51,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:52,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777803705] [2020-02-10 20:20:52,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:52,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398224542] [2020-02-10 20:20:52,256 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:52,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:52,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:52,256 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:20:52,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:52,394 INFO L93 Difference]: Finished difference Result 1221 states and 4289 transitions. [2020-02-10 20:20:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:52,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:52,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:52,397 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 20:20:52,397 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:20:52,397 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:52,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:20:52,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 20:20:52,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:20:52,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3110 transitions. [2020-02-10 20:20:52,418 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3110 transitions. Word has length 25 [2020-02-10 20:20:52,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:52,418 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3110 transitions. [2020-02-10 20:20:52,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:52,418 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3110 transitions. [2020-02-10 20:20:52,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:52,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:52,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, 1, 1, 1] [2020-02-10 20:20:52,419 INFO L427 AbstractCegarLoop]: === Iteration 901 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:52,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:52,420 INFO L82 PathProgramCache]: Analyzing trace with hash -2133418855, now seen corresponding path program 894 times [2020-02-10 20:20:52,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:52,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059210947] [2020-02-10 20:20:52,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:52,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:52,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 20:20:52,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059210947] [2020-02-10 20:20:52,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:52,804 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:52,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225355419] [2020-02-10 20:20:52,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:52,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:52,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:52,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:52,804 INFO L87 Difference]: Start difference. First operand 783 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:20:52,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:52,942 INFO L93 Difference]: Finished difference Result 1222 states and 4285 transitions. [2020-02-10 20:20:52,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:52,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:52,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:52,946 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:20:52,946 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:20:52,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:52,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:20:52,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 773. [2020-02-10 20:20:52,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:52,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:20:52,968 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:20:52,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:52,968 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:20:52,968 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:52,968 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:20:52,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:52,969 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:52,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, 1, 1, 1] [2020-02-10 20:20:52,969 INFO L427 AbstractCegarLoop]: === Iteration 902 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:52,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:52,969 INFO L82 PathProgramCache]: Analyzing trace with hash 332703619, now seen corresponding path program 895 times [2020-02-10 20:20:52,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:52,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022434463] [2020-02-10 20:20:52,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:52,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:53,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:53,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022434463] [2020-02-10 20:20:53,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:53,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:53,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094374396] [2020-02-10 20:20:53,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:53,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:53,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:53,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:53,310 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:20:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,449 INFO L93 Difference]: Finished difference Result 1201 states and 4243 transitions. [2020-02-10 20:20:53,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:53,449 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,452 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:20:53,452 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:20:53,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:20:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 779. [2020-02-10 20:20:53,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:20:53,474 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:53,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,474 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:20:53,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:53,474 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:20:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:53,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20: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, 1, 1, 1] [2020-02-10 20:20:53,475 INFO L427 AbstractCegarLoop]: === Iteration 903 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1302955233, now seen corresponding path program 896 times [2020-02-10 20:20:53,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214205239] [2020-02-10 20:20:53,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:53,816 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:53,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214205239] [2020-02-10 20:20:53,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:53,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:53,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466360439] [2020-02-10 20:20:53,817 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:53,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:53,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:53,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:53,817 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:20:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:53,952 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 20:20:53,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:53,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:53,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:53,956 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:20:53,956 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:20:53,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:53,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:20:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 775. [2020-02-10 20:20:53,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:53,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:20:53,977 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:20:53,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:53,978 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:20:53,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:20:53,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:53,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:53,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, 1, 1, 1] [2020-02-10 20:20:53,979 INFO L427 AbstractCegarLoop]: === Iteration 904 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:53,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:53,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1372939417, now seen corresponding path program 897 times [2020-02-10 20:20:53,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:53,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28421941] [2020-02-10 20:20:53,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:54,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 20:20:54,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28421941] [2020-02-10 20:20:54,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:54,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147055226] [2020-02-10 20:20:54,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:54,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:54,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:54,316 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:20:54,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,450 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 20:20:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:54,450 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:54,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:54,453 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:20:54,453 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:20:54,453 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:54,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:20:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:20:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:20:54,474 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:20:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:54,474 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:20:54,474 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:20:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:54,475 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:54,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, 1, 1, 1] [2020-02-10 20:20:54,475 INFO L427 AbstractCegarLoop]: === Iteration 905 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:54,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:54,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1899260745, now seen corresponding path program 898 times [2020-02-10 20:20:54,476 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:54,476 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844964256] [2020-02-10 20:20:54,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:54,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:54,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844964256] [2020-02-10 20:20:54,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:54,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:54,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90730785] [2020-02-10 20:20:54,851 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:54,851 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:54,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:54,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:54,851 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:20:54,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:54,998 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:20:54,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:54,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:54,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:55,002 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:20:55,002 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:20:55,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:55,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:20:55,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 775. [2020-02-10 20:20:55,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:55,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:20:55,023 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:20:55,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:55,023 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:20:55,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:55,024 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:20:55,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:55,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:55,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, 1, 1, 1] [2020-02-10 20:20:55,025 INFO L427 AbstractCegarLoop]: === Iteration 906 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:55,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:55,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1351001981, now seen corresponding path program 899 times [2020-02-10 20:20:55,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:55,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400969256] [2020-02-10 20:20:55,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:55,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400969256] [2020-02-10 20:20:55,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:55,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:55,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955785969] [2020-02-10 20:20:55,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:55,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:55,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:55,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:55,363 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:20:55,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:55,534 INFO L93 Difference]: Finished difference Result 1199 states and 4233 transitions. [2020-02-10 20:20:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:55,534 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:55,537 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:20:55,537 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:20:55,538 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:55,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:20:55,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 20:20:55,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:55,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:20:55,560 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:55,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:55,560 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:20:55,560 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:55,560 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:20:55,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:55,561 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:55,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, 1, 1, 1] [2020-02-10 20:20:55,561 INFO L427 AbstractCegarLoop]: === Iteration 907 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:55,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:55,562 INFO L82 PathProgramCache]: Analyzing trace with hash -1886231783, now seen corresponding path program 900 times [2020-02-10 20:20:55,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:55,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855408712] [2020-02-10 20:20:55,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:55,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:55,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855408712] [2020-02-10 20:20:55,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:55,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:55,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413955413] [2020-02-10 20:20:55,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:55,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:55,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:55,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:55,913 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:56,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,054 INFO L93 Difference]: Finished difference Result 1195 states and 4223 transitions. [2020-02-10 20:20:56,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:56,054 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:56,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,057 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:20:56,057 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:20:56,057 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:56,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:20:56,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 773. [2020-02-10 20:20:56,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:56,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:20:56,078 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:20:56,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,078 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:20:56,078 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:56,078 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:20:56,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:56,079 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,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, 1, 1, 1] [2020-02-10 20:20:56,079 INFO L427 AbstractCegarLoop]: === Iteration 908 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,080 INFO L82 PathProgramCache]: Analyzing trace with hash -955166973, now seen corresponding path program 901 times [2020-02-10 20:20:56,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,080 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172048547] [2020-02-10 20:20:56,080 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172048547] [2020-02-10 20:20:56,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:56,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486676706] [2020-02-10 20:20:56,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:56,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:56,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:56,422 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:20:56,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:56,576 INFO L93 Difference]: Finished difference Result 1203 states and 4245 transitions. [2020-02-10 20:20:56,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:56,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:56,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:56,580 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:20:56,580 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:20:56,580 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:56,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:20:56,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 779. [2020-02-10 20:20:56,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:20:56,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:20:56,601 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:20:56,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:56,602 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:20:56,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:56,602 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:20:56,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:56,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:56,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, 1, 1, 1] [2020-02-10 20:20:56,603 INFO L427 AbstractCegarLoop]: === Iteration 909 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:56,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:56,603 INFO L82 PathProgramCache]: Analyzing trace with hash 36090849, now seen corresponding path program 902 times [2020-02-10 20:20:56,603 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:56,603 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257431002] [2020-02-10 20:20:56,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:56,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:56,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:56,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257431002] [2020-02-10 20:20:56,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:56,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:56,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25896782] [2020-02-10 20:20:56,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:56,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:56,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:56,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:56,949 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:20:57,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:57,089 INFO L93 Difference]: Finished difference Result 1206 states and 4247 transitions. [2020-02-10 20:20:57,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:57,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:57,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:57,092 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:20:57,092 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:20:57,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:57,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:20:57,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 775. [2020-02-10 20:20:57,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:57,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:20:57,113 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:20:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:57,113 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:20:57,113 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:20:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:57,114 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:57,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, 1, 1, 1] [2020-02-10 20:20:57,114 INFO L427 AbstractCegarLoop]: === Iteration 910 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:57,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:57,115 INFO L82 PathProgramCache]: Analyzing trace with hash 527967965, now seen corresponding path program 903 times [2020-02-10 20:20:57,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:57,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364628812] [2020-02-10 20:20:57,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:57,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:57,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364628812] [2020-02-10 20:20:57,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:57,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:57,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140160464] [2020-02-10 20:20:57,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:57,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:57,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:57,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:57,457 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:20:57,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:57,596 INFO L93 Difference]: Finished difference Result 1196 states and 4227 transitions. [2020-02-10 20:20:57,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:57,597 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:57,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:57,600 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:20:57,600 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:20:57,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:57,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:20:57,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 777. [2020-02-10 20:20:57,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:20:57,621 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:20:57,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:57,621 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:20:57,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:57,621 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:20:57,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:57,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:57,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, 1, 1, 1] [2020-02-10 20:20:57,623 INFO L427 AbstractCegarLoop]: === Iteration 911 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:57,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:57,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1550735099, now seen corresponding path program 904 times [2020-02-10 20:20:57,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:57,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778775510] [2020-02-10 20:20:57,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:57,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778775510] [2020-02-10 20:20:57,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:57,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:57,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107955545] [2020-02-10 20:20:57,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:57,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:57,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:57,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:57,963 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:20:58,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,107 INFO L93 Difference]: Finished difference Result 1194 states and 4221 transitions. [2020-02-10 20:20:58,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:58,107 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:58,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,110 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:20:58,111 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:20:58,111 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:58,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:20:58,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:20:58,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:20:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:20:58,132 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:20:58,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,132 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:20:58,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:20:58,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:58,133 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,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, 1, 1, 1] [2020-02-10 20:20:58,133 INFO L427 AbstractCegarLoop]: === Iteration 912 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1677100931, now seen corresponding path program 905 times [2020-02-10 20:20:58,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607571723] [2020-02-10 20:20:58,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:58,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:20:58,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607571723] [2020-02-10 20:20:58,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:58,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:58,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535180001] [2020-02-10 20:20:58,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:58,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:58,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:58,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:58,479 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:20:58,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:58,636 INFO L93 Difference]: Finished difference Result 1202 states and 4237 transitions. [2020-02-10 20:20:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:58,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:58,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:58,639 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:20:58,639 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:20:58,639 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:58,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:20:58,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:20:58,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:20:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:20:58,660 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:20:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:58,660 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:20:58,660 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:20:58,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:58,661 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:58,661 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:20:58,661 INFO L427 AbstractCegarLoop]: === Iteration 913 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:58,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2080010787, now seen corresponding path program 906 times [2020-02-10 20:20:58,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:58,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264394486] [2020-02-10 20:20:58,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:58,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20: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 20:20:59,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264394486] [2020-02-10 20:20:59,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:59,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:59,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091659499] [2020-02-10 20:20:59,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:59,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:59,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:59,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:59,013 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:20:59,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:59,173 INFO L93 Difference]: Finished difference Result 1197 states and 4225 transitions. [2020-02-10 20:20:59,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:59,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:59,177 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:20:59,177 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:20:59,177 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:59,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:20:59,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:20:59,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:20:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:20:59,197 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:20:59,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:59,197 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:20:59,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:20:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:59,198 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:59,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, 1, 1, 1] [2020-02-10 20:20:59,199 INFO L427 AbstractCegarLoop]: === Iteration 914 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:59,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:59,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1728628485, now seen corresponding path program 907 times [2020-02-10 20:20:59,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:59,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100005433] [2020-02-10 20:20:59,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:59,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:20:59,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 20:20:59,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100005433] [2020-02-10 20:20:59,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:20:59,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:20:59,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549601745] [2020-02-10 20:20:59,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:20:59,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:20:59,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:20:59,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:20:59,561 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:20:59,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:20:59,700 INFO L93 Difference]: Finished difference Result 1213 states and 4267 transitions. [2020-02-10 20:20:59,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:20:59,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:20:59,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:20:59,703 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:20:59,704 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:20:59,704 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:20:59,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:20:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 20:20:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:20:59,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:20:59,725 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:20:59,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:20:59,725 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:20:59,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:20:59,725 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:20:59,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:20:59,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:20:59,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, 1, 1, 1] [2020-02-10 20:20:59,726 INFO L427 AbstractCegarLoop]: === Iteration 915 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:20:59,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:20:59,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1493253431, now seen corresponding path program 908 times [2020-02-10 20:20:59,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:20:59,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516329008] [2020-02-10 20:20:59,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:20:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,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 20:21:00,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516329008] [2020-02-10 20:21:00,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:00,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051980557] [2020-02-10 20:21:00,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:00,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:00,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:00,079 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:21:00,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,213 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 20:21:00,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:00,213 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:00,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,216 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:21:00,217 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:00,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:00,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:00,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:21:00,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:00,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:00,238 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:00,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,238 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:00,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:00,238 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:00,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:00,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,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, 1, 1, 1] [2020-02-10 20:21:00,240 INFO L427 AbstractCegarLoop]: === Iteration 916 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2059992545, now seen corresponding path program 909 times [2020-02-10 20:21:00,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724696096] [2020-02-10 20:21:00,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:00,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:00,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724696096] [2020-02-10 20:21:00,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:00,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:00,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169288039] [2020-02-10 20:21:00,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:00,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:00,576 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:00,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:00,723 INFO L93 Difference]: Finished difference Result 1204 states and 4243 transitions. [2020-02-10 20:21:00,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:00,723 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:00,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:00,726 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:21:00,726 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:21:00,727 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:21:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 777. [2020-02-10 20:21:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:00,748 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:00,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:00,749 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:00,749 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:00,749 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:00,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:00,750 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:00,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, 1, 1, 1] [2020-02-10 20:21:00,750 INFO L427 AbstractCegarLoop]: === Iteration 917 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:00,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1524762743, now seen corresponding path program 910 times [2020-02-10 20:21:00,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:00,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314630107] [2020-02-10 20:21:00,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:01,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:01,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314630107] [2020-02-10 20:21:01,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:01,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:01,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415287086] [2020-02-10 20:21:01,087 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:01,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:01,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:01,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:01,087 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:01,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:01,244 INFO L93 Difference]: Finished difference Result 1200 states and 4233 transitions. [2020-02-10 20:21:01,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:01,245 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:01,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:01,248 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:21:01,248 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:21:01,248 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:01,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:21:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 775. [2020-02-10 20:21:01,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:01,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:01,270 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:01,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:01,270 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:01,270 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:01,270 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:01,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:01,271 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:01,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, 1, 1, 1] [2020-02-10 20:21:01,271 INFO L427 AbstractCegarLoop]: === Iteration 918 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:01,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:01,271 INFO L82 PathProgramCache]: Analyzing trace with hash 2080998753, now seen corresponding path program 911 times [2020-02-10 20:21:01,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:01,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647923402] [2020-02-10 20:21:01,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:01,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647923402] [2020-02-10 20:21:01,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:01,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:01,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760995383] [2020-02-10 20:21:01,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:01,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:01,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:01,616 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:01,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:01,749 INFO L93 Difference]: Finished difference Result 1206 states and 4245 transitions. [2020-02-10 20:21:01,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:01,749 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:01,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:01,753 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:21:01,753 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:21:01,753 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:01,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:21:01,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:21:01,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:01,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:01,774 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:01,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:01,774 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:01,774 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:01,775 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:01,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:01,775 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:01,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, 1, 1, 1] [2020-02-10 20:21:01,776 INFO L427 AbstractCegarLoop]: === Iteration 919 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:01,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:01,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1676112965, now seen corresponding path program 912 times [2020-02-10 20:21:01,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:01,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439237099] [2020-02-10 20:21:01,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:01,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:02,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439237099] [2020-02-10 20:21:02,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:02,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566965424] [2020-02-10 20:21:02,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:02,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:02,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:02,119 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:02,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:02,281 INFO L93 Difference]: Finished difference Result 1201 states and 4233 transitions. [2020-02-10 20:21:02,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:02,282 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:02,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:02,285 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:21:02,285 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:21:02,285 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:02,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:21:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 20:21:02,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:21:02,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:21:02,306 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:21:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:02,306 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:21:02,306 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:21:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:02,307 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:02,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, 1, 1, 1] [2020-02-10 20:21:02,307 INFO L427 AbstractCegarLoop]: === Iteration 920 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1403413765, now seen corresponding path program 913 times [2020-02-10 20:21:02,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:02,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452691] [2020-02-10 20:21:02,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:02,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:02,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 20:21:02,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452691] [2020-02-10 20:21:02,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:02,679 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:02,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131873269] [2020-02-10 20:21:02,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:02,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:02,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:02,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:02,680 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:21:02,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:02,825 INFO L93 Difference]: Finished difference Result 1194 states and 4226 transitions. [2020-02-10 20:21:02,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:02,826 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:02,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:02,829 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:21:02,829 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:21:02,829 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:02,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:21:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:21:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:02,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3106 transitions. [2020-02-10 20:21:02,850 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3106 transitions. Word has length 25 [2020-02-10 20:21:02,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:02,850 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3106 transitions. [2020-02-10 20:21:02,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3106 transitions. [2020-02-10 20:21:02,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:02,851 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:02,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, 1, 1, 1] [2020-02-10 20:21:02,851 INFO L427 AbstractCegarLoop]: === Iteration 921 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:02,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash -422659047, now seen corresponding path program 914 times [2020-02-10 20:21:02,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:02,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783728501] [2020-02-10 20:21:02,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21: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 20:21:03,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783728501] [2020-02-10 20:21:03,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:03,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:03,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643310144] [2020-02-10 20:21:03,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:03,233 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:03,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:03,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:03,233 INFO L87 Difference]: Start difference. First operand 779 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:21:03,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,394 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:21:03,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:03,394 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:03,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,397 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:21:03,397 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:03,398 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:03,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 776. [2020-02-10 20:21:03,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:03,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3098 transitions. [2020-02-10 20:21:03,418 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,418 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3098 transitions. [2020-02-10 20:21:03,418 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:03,418 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3098 transitions. [2020-02-10 20:21:03,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:03,419 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,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, 1, 1, 1] [2020-02-10 20:21:03,420 INFO L427 AbstractCegarLoop]: === Iteration 922 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,420 INFO L82 PathProgramCache]: Analyzing trace with hash 522620313, now seen corresponding path program 915 times [2020-02-10 20:21:03,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,420 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483025063] [2020-02-10 20:21:03,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:03,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 20:21:03,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483025063] [2020-02-10 20:21:03,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:03,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:03,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385327838] [2020-02-10 20:21:03,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:03,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:03,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:03,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:03,781 INFO L87 Difference]: Start difference. First operand 776 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:03,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:03,918 INFO L93 Difference]: Finished difference Result 1199 states and 4234 transitions. [2020-02-10 20:21:03,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:03,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:03,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:03,922 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:21:03,922 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:21:03,922 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:03,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:21:03,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:21:03,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:03,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:21:03,943 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:21:03,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:03,943 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:21:03,943 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:21:03,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:03,944 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:03,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, 1, 1, 1] [2020-02-10 20:21:03,944 INFO L427 AbstractCegarLoop]: === Iteration 923 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:03,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:03,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1513878135, now seen corresponding path program 916 times [2020-02-10 20:21:03,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:03,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969872278] [2020-02-10 20:21:03,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969872278] [2020-02-10 20:21:04,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:04,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196259170] [2020-02-10 20:21:04,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:04,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:04,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:04,317 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:21:04,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:04,456 INFO L93 Difference]: Finished difference Result 1202 states and 4236 transitions. [2020-02-10 20:21:04,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:04,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:04,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:04,459 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:21:04,460 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:21:04,460 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:04,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:21:04,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 776. [2020-02-10 20:21:04,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3095 transitions. [2020-02-10 20:21:04,480 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3095 transitions. Word has length 25 [2020-02-10 20:21:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:04,481 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3095 transitions. [2020-02-10 20:21:04,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:04,481 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3095 transitions. [2020-02-10 20:21:04,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:04,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:04,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, 1, 1, 1] [2020-02-10 20:21:04,482 INFO L427 AbstractCegarLoop]: === Iteration 924 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:04,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:04,482 INFO L82 PathProgramCache]: Analyzing trace with hash 241562363, now seen corresponding path program 917 times [2020-02-10 20:21:04,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:04,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302448281] [2020-02-10 20:21:04,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:04,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:04,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:04,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302448281] [2020-02-10 20:21:04,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:04,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:04,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390964059] [2020-02-10 20:21:04,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:04,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:04,846 INFO L87 Difference]: Start difference. First operand 776 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:21:04,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:04,985 INFO L93 Difference]: Finished difference Result 1196 states and 4224 transitions. [2020-02-10 20:21:04,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:04,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:04,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:04,989 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:21:04,989 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:21:04,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:05,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:21:05,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 20:21:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:05,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:21:05,010 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:05,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,011 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:21:05,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:05,011 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:21:05,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:05,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:05,012 INFO L427 AbstractCegarLoop]: === Iteration 925 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1852503321, now seen corresponding path program 918 times [2020-02-10 20:21:05,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972236234] [2020-02-10 20:21:05,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:05,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 20:21:05,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972236234] [2020-02-10 20:21:05,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:05,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:05,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71287877] [2020-02-10 20:21:05,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:05,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:05,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:05,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:05,384 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:05,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:05,526 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:21:05,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:05,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:05,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:05,529 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:21:05,529 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:05,529 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:05,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:05,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 20:21:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:05,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:21:05,550 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:21:05,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:05,550 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:21:05,550 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:05,550 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:21:05,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:05,551 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:05,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, 1, 1, 1] [2020-02-10 20:21:05,551 INFO L427 AbstractCegarLoop]: === Iteration 926 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:05,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:05,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1624096353, now seen corresponding path program 919 times [2020-02-10 20:21:05,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:05,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016162058] [2020-02-10 20:21:05,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:05,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:05,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:05,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016162058] [2020-02-10 20:21:05,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:05,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:05,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309274619] [2020-02-10 20:21:05,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:05,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:05,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:05,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:05,925 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:21:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,065 INFO L93 Difference]: Finished difference Result 1185 states and 4201 transitions. [2020-02-10 20:21:06,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:06,065 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,068 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:21:06,068 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:06,068 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:06,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:21:06,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:06,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:21:06,088 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:06,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,089 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:21:06,089 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:21:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:06,090 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,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, 1, 1, 1] [2020-02-10 20:21:06,090 INFO L427 AbstractCegarLoop]: === Iteration 927 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1690116225, now seen corresponding path program 920 times [2020-02-10 20:21:06,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250340789] [2020-02-10 20:21:06,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:06,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250340789] [2020-02-10 20:21:06,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:06,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:06,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402838194] [2020-02-10 20:21:06,469 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:06,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:06,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:06,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:06,469 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:06,603 INFO L93 Difference]: Finished difference Result 1184 states and 4196 transitions. [2020-02-10 20:21:06,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:06,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:06,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:06,607 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:21:06,607 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:21:06,607 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:06,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:21:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:21:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:06,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:21:06,643 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:21:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:06,643 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:21:06,644 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:06,644 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:21:06,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:06,645 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:06,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, 1, 1, 1] [2020-02-10 20:21:06,645 INFO L427 AbstractCegarLoop]: === Iteration 928 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:06,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:06,645 INFO L82 PathProgramCache]: Analyzing trace with hash 738298073, now seen corresponding path program 921 times [2020-02-10 20:21:06,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:06,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362028391] [2020-02-10 20:21:06,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362028391] [2020-02-10 20:21:07,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:07,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806416840] [2020-02-10 20:21:07,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:07,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:07,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:07,017 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:21:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:07,154 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 20:21:07,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:07,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:07,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:07,158 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:21:07,158 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:21:07,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:07,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:21:07,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:21:07,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:07,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:21:07,180 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:07,180 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:21:07,180 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:07,180 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:21:07,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:07,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:07,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, 1, 1, 1] [2020-02-10 20:21:07,181 INFO L427 AbstractCegarLoop]: === Iteration 929 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:07,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:07,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1761065207, now seen corresponding path program 922 times [2020-02-10 20:21:07,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:07,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888388138] [2020-02-10 20:21:07,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:07,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:07,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888388138] [2020-02-10 20:21:07,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:07,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:07,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887822989] [2020-02-10 20:21:07,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:07,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:07,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:07,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:07,548 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:07,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:07,720 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:21:07,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:07,721 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:07,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:07,724 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:21:07,724 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:21:07,724 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:07,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:21:07,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:21:07,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:07,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:07,745 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:07,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:07,745 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:07,745 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:07,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:07,746 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:07,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, 1, 1, 1] [2020-02-10 20:21:07,746 INFO L427 AbstractCegarLoop]: === Iteration 930 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:07,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:07,746 INFO L82 PathProgramCache]: Analyzing trace with hash -49106143, now seen corresponding path program 923 times [2020-02-10 20:21:07,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:07,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111851811] [2020-02-10 20:21:07,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:07,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:08,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 20:21:08,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111851811] [2020-02-10 20:21:08,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:08,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:08,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044254812] [2020-02-10 20:21:08,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:08,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:08,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:08,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:08,127 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,271 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:21:08,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:08,272 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,275 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:21:08,275 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:21:08,275 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:21:08,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:21:08,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:08,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:08,297 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:08,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,297 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:08,297 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:08,298 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,298 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:08,298 INFO L427 AbstractCegarLoop]: === Iteration 931 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,298 INFO L82 PathProgramCache]: Analyzing trace with hash 2099690393, now seen corresponding path program 924 times [2020-02-10 20:21:08,298 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699178087] [2020-02-10 20:21:08,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:08,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:08,674 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699178087] [2020-02-10 20:21:08,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:08,674 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:08,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877084459] [2020-02-10 20:21:08,675 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:08,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:08,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:08,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:08,675 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:08,840 INFO L93 Difference]: Finished difference Result 1180 states and 4184 transitions. [2020-02-10 20:21:08,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:08,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:08,843 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:21:08,843 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:21:08,844 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:08,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:21:08,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:21:08,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:08,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:21:08,864 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:21:08,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:08,865 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:21:08,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:08,865 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:21:08,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:08,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:08,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, 1, 1, 1] [2020-02-10 20:21:08,866 INFO L427 AbstractCegarLoop]: === Iteration 932 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:08,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:08,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1167322591, now seen corresponding path program 925 times [2020-02-10 20:21:08,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:08,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062265509] [2020-02-10 20:21:08,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:08,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,228 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062265509] [2020-02-10 20:21:09,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:09,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626916001] [2020-02-10 20:21:09,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:09,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:09,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:09,229 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:21:09,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,367 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 20:21:09,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:09,368 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:09,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,371 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:21:09,371 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:21:09,371 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:09,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:21:09,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:21:09,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:09,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:21:09,392 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,392 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:21:09,392 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:09,393 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:21:09,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:09,393 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,394 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:09,394 INFO L427 AbstractCegarLoop]: === Iteration 933 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,394 INFO L82 PathProgramCache]: Analyzing trace with hash -176064769, now seen corresponding path program 926 times [2020-02-10 20:21:09,394 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,394 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789047183] [2020-02-10 20:21:09,394 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:09,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789047183] [2020-02-10 20:21:09,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:09,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:09,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969776564] [2020-02-10 20:21:09,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:09,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:09,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:09,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:09,758 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:09,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:09,952 INFO L93 Difference]: Finished difference Result 1198 states and 4223 transitions. [2020-02-10 20:21:09,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:09,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:09,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:09,955 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:21:09,955 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:09,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:09,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:21:09,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:09,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:09,976 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:09,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:09,976 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:09,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:09,977 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:09,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:09,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, 1, 1, 1] [2020-02-10 20:21:09,978 INFO L427 AbstractCegarLoop]: === Iteration 934 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash 315812347, now seen corresponding path program 927 times [2020-02-10 20:21:09,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:09,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205143481] [2020-02-10 20:21:09,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:09,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205143481] [2020-02-10 20:21:10,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:10,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183698789] [2020-02-10 20:21:10,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:10,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:10,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:10,343 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:10,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:10,505 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 20:21:10,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:10,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:10,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:10,508 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:21:10,508 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:21:10,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:10,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:21:10,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:21:10,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:10,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:10,529 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:10,529 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:10,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:10,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:10,530 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:10,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, 1, 1, 1] [2020-02-10 20:21:10,530 INFO L427 AbstractCegarLoop]: === Iteration 935 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:10,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:10,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1338579481, now seen corresponding path program 928 times [2020-02-10 20:21:10,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:10,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267028874] [2020-02-10 20:21:10,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:10,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:10,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:10,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267028874] [2020-02-10 20:21:10,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:10,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:10,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236654100] [2020-02-10 20:21:10,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:10,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:10,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:10,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:10,892 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:11,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,037 INFO L93 Difference]: Finished difference Result 1186 states and 4197 transitions. [2020-02-10 20:21:11,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:11,038 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:11,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,041 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:21:11,041 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:21:11,041 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:11,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:21:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:21:11,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:11,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:11,063 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:11,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,063 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:11,063 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:11,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:11,064 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,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, 1, 1, 1] [2020-02-10 20:21:11,064 INFO L427 AbstractCegarLoop]: === Iteration 936 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1464945313, now seen corresponding path program 929 times [2020-02-10 20:21:11,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764882059] [2020-02-10 20:21:11,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764882059] [2020-02-10 20:21:11,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,429 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:11,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746838452] [2020-02-10 20:21:11,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:11,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:11,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:11,429 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:11,577 INFO L93 Difference]: Finished difference Result 1194 states and 4213 transitions. [2020-02-10 20:21:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:11,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:11,581 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:21:11,581 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:11,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:11,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:21:11,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:11,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:11,602 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:11,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:11,602 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:11,602 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:11,602 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:11,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:11,603 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:11,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, 1, 1, 1] [2020-02-10 20:21:11,604 INFO L427 AbstractCegarLoop]: === Iteration 937 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:11,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:11,604 INFO L82 PathProgramCache]: Analyzing trace with hash 2002800891, now seen corresponding path program 930 times [2020-02-10 20:21:11,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:11,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826828811] [2020-02-10 20:21:11,604 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:11,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:11,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:11,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826828811] [2020-02-10 20:21:11,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:11,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:11,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807287914] [2020-02-10 20:21:11,964 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:11,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:11,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:11,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:11,965 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:12,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,150 INFO L93 Difference]: Finished difference Result 1189 states and 4201 transitions. [2020-02-10 20:21:12,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:12,151 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:12,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,154 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:21:12,154 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:21:12,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:12,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:21:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:21:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:12,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:21:12,175 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:21:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,176 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:21:12,176 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:12,176 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:21:12,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:12,177 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,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, 1, 1, 1] [2020-02-10 20:21:12,177 INFO L427 AbstractCegarLoop]: === Iteration 938 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,177 INFO L82 PathProgramCache]: Analyzing trace with hash -426732647, now seen corresponding path program 931 times [2020-02-10 20:21:12,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765794375] [2020-02-10 20:21:12,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:12,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:12,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765794375] [2020-02-10 20:21:12,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:12,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:12,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896127959] [2020-02-10 20:21:12,543 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:12,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:12,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:12,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:12,544 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:21:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:12,690 INFO L93 Difference]: Finished difference Result 1190 states and 4207 transitions. [2020-02-10 20:21:12,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:12,691 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:12,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:12,694 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:21:12,694 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:12,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:12,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 20:21:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:21:12,716 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:12,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:12,716 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:21:12,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:12,716 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:21:12,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:12,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:12,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:12,717 INFO L427 AbstractCegarLoop]: === Iteration 939 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:12,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1184208311, now seen corresponding path program 932 times [2020-02-10 20:21:12,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:12,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170825865] [2020-02-10 20:21:12,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170825865] [2020-02-10 20:21:13,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:13,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648968199] [2020-02-10 20:21:13,075 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:13,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:13,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:13,076 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:13,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:13,267 INFO L93 Difference]: Finished difference Result 1194 states and 4212 transitions. [2020-02-10 20:21:13,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:13,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:13,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:13,271 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:21:13,271 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:21:13,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:13,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:21:13,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:21:13,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:13,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:13,292 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:13,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:13,292 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:13,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:13,292 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:13,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:13,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:13,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, 1, 1, 1] [2020-02-10 20:21:13,294 INFO L427 AbstractCegarLoop]: === Iteration 940 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:13,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:13,294 INFO L82 PathProgramCache]: Analyzing trace with hash -933078913, now seen corresponding path program 933 times [2020-02-10 20:21:13,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:13,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544042977] [2020-02-10 20:21:13,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:13,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:13,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:13,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544042977] [2020-02-10 20:21:13,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:13,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:13,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565019469] [2020-02-10 20:21:13,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:13,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:13,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:13,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:13,665 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:13,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:13,813 INFO L93 Difference]: Finished difference Result 1184 states and 4192 transitions. [2020-02-10 20:21:13,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:13,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:13,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:13,816 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:21:13,816 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:13,816 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:13,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:13,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:21:13,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:13,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:13,837 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:13,837 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:13,837 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:13,838 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:13,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:13,838 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:13,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, 1, 1, 1] [2020-02-10 20:21:13,839 INFO L427 AbstractCegarLoop]: === Iteration 941 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:13,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:13,839 INFO L82 PathProgramCache]: Analyzing trace with hash 1215717623, now seen corresponding path program 934 times [2020-02-10 20:21:13,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:13,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109277597] [2020-02-10 20:21:13,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:13,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:14,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:14,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109277597] [2020-02-10 20:21:14,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:14,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:14,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990053847] [2020-02-10 20:21:14,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:14,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:14,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:14,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:14,207 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:14,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,384 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:21:14,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:14,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:14,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,388 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:21:14,388 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:21:14,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:14,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:21:14,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:21:14,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:14,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:21:14,409 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:21:14,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,409 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:21:14,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:14,409 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:21:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:14,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,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, 1, 1, 1] [2020-02-10 20:21:14,410 INFO L427 AbstractCegarLoop]: === Iteration 942 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,411 INFO L82 PathProgramCache]: Analyzing trace with hash -922575809, now seen corresponding path program 935 times [2020-02-10 20:21:14,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575824140] [2020-02-10 20:21:14,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:14,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:14,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575824140] [2020-02-10 20:21:14,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:14,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:14,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344045376] [2020-02-10 20:21:14,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:14,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:14,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:14,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:14,778 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:21:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:14,924 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 20:21:14,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:14,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:14,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:14,927 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:21:14,927 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:14,928 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:14,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:14,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:21:14,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:14,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:21:14,949 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:21:14,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:14,949 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:21:14,949 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:21:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:14,950 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:14,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, 1, 1, 1] [2020-02-10 20:21:14,950 INFO L427 AbstractCegarLoop]: === Iteration 943 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:14,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:14,950 INFO L82 PathProgramCache]: Analyzing trace with hash -384720231, now seen corresponding path program 936 times [2020-02-10 20:21:14,950 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:14,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895955960] [2020-02-10 20:21:14,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:14,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895955960] [2020-02-10 20:21:15,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:15,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846789841] [2020-02-10 20:21:15,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:15,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:15,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:15,310 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:21:15,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:15,516 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 20:21:15,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:15,516 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:15,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:15,520 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:21:15,520 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:21:15,520 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:21:15,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 771. [2020-02-10 20:21:15,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:21:15,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:21:15,541 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:21:15,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:15,541 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:21:15,541 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:21:15,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:15,542 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:15,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, 1, 1, 1] [2020-02-10 20:21:15,543 INFO L427 AbstractCegarLoop]: === Iteration 944 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:15,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:15,543 INFO L82 PathProgramCache]: Analyzing trace with hash -241103101, now seen corresponding path program 937 times [2020-02-10 20:21:15,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:15,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478510998] [2020-02-10 20:21:15,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:15,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:15,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478510998] [2020-02-10 20:21:15,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:15,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:15,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945761045] [2020-02-10 20:21:15,913 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:15,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:15,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:15,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:15,913 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:21:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:16,058 INFO L93 Difference]: Finished difference Result 1206 states and 4252 transitions. [2020-02-10 20:21:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:16,058 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:16,061 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:21:16,061 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:21:16,062 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:21:16,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 779. [2020-02-10 20:21:16,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:16,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:21:16,083 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:21:16,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:16,083 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:21:16,083 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:16,083 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:21:16,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:16,084 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:16,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, 1, 1, 1] [2020-02-10 20:21:16,085 INFO L427 AbstractCegarLoop]: === Iteration 945 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:16,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:16,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1369837857, now seen corresponding path program 938 times [2020-02-10 20:21:16,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:16,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463320220] [2020-02-10 20:21:16,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:16,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:16,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463320220] [2020-02-10 20:21:16,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:16,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:16,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952910702] [2020-02-10 20:21:16,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:16,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:16,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:16,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:16,456 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:21:16,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:16,623 INFO L93 Difference]: Finished difference Result 1203 states and 4243 transitions. [2020-02-10 20:21:16,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:16,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:16,627 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:21:16,627 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:21:16,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:16,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:21:16,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 776. [2020-02-10 20:21:16,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:21:16,647 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:16,648 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:21:16,648 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:21:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:16,649 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:16,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, 1, 1, 1] [2020-02-10 20:21:16,649 INFO L427 AbstractCegarLoop]: === Iteration 946 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:16,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:16,649 INFO L82 PathProgramCache]: Analyzing trace with hash -1841540955, now seen corresponding path program 939 times [2020-02-10 20:21:16,649 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:16,649 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232971128] [2020-02-10 20:21:16,649 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232971128] [2020-02-10 20:21:17,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:17,016 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331834163] [2020-02-10 20:21:17,016 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:17,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:17,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:17,016 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,156 INFO L93 Difference]: Finished difference Result 1213 states and 4266 transitions. [2020-02-10 20:21:17,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:17,157 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,160 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:21:17,160 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:21:17,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:17,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:21:17,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:21:17,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:21:17,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:21:17,181 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:21:17,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,182 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:21:17,182 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:17,182 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:21:17,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:17,183 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:17,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, 1, 1, 1] [2020-02-10 20:21:17,183 INFO L427 AbstractCegarLoop]: === Iteration 947 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1380340961, now seen corresponding path program 940 times [2020-02-10 20:21:17,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754806859] [2020-02-10 20:21:17,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:17,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754806859] [2020-02-10 20:21:17,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:17,598 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:17,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227165090] [2020-02-10 20:21:17,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:17,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:17,599 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:21:17,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:17,768 INFO L93 Difference]: Finished difference Result 1214 states and 4262 transitions. [2020-02-10 20:21:17,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:17,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:17,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:17,771 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:21:17,771 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:17,771 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:17,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:17,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 776. [2020-02-10 20:21:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:21:17,792 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:21:17,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:17,792 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:21:17,792 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:17,792 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:21:17,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:17,793 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21: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, 1, 1, 1] [2020-02-10 20:21:17,793 INFO L427 AbstractCegarLoop]: === Iteration 948 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:17,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1831037851, now seen corresponding path program 941 times [2020-02-10 20:21:17,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:17,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315945156] [2020-02-10 20:21:17,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315945156] [2020-02-10 20:21:18,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:18,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50666785] [2020-02-10 20:21:18,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:18,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:18,177 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:21:18,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:18,318 INFO L93 Difference]: Finished difference Result 1204 states and 4242 transitions. [2020-02-10 20:21:18,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:18,318 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:18,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:18,321 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:21:18,321 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:18,322 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:18,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:18,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 779. [2020-02-10 20:21:18,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:18,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:21:18,342 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:18,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,343 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:21:18,343 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:18,343 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:21:18,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:18,344 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,344 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:18,344 INFO L427 AbstractCegarLoop]: === Iteration 949 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,344 INFO L82 PathProgramCache]: Analyzing trace with hash -220096893, now seen corresponding path program 942 times [2020-02-10 20:21:18,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512039365] [2020-02-10 20:21:18,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:18,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:18,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512039365] [2020-02-10 20:21:18,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:18,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:18,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554915367] [2020-02-10 20:21:18,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:18,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:18,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:18,718 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:18,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:18,884 INFO L93 Difference]: Finished difference Result 1208 states and 4247 transitions. [2020-02-10 20:21:18,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:18,885 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:18,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:18,888 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:21:18,888 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:21:18,888 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:18,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:21:18,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 773. [2020-02-10 20:21:18,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:21:18,909 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:21:18,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:18,909 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:21:18,909 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:18,909 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:21:18,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:18,910 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:18,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, 1, 1, 1] [2020-02-10 20:21:18,911 INFO L427 AbstractCegarLoop]: === Iteration 950 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:18,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:18,911 INFO L82 PathProgramCache]: Analyzing trace with hash 1242031837, now seen corresponding path program 943 times [2020-02-10 20:21:18,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:18,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837052863] [2020-02-10 20:21:18,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:19,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:19,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837052863] [2020-02-10 20:21:19,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:19,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:19,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371704200] [2020-02-10 20:21:19,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:19,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:19,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:19,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:19,279 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:21:19,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:19,471 INFO L93 Difference]: Finished difference Result 1195 states and 4221 transitions. [2020-02-10 20:21:19,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:19,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:19,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:19,474 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:21:19,475 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:21:19,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:19,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:21:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 778. [2020-02-10 20:21:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:19,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:21:19,496 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:19,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:19,496 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:21:19,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:21:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:19,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:19,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, 1, 1, 1] [2020-02-10 20:21:19,497 INFO L427 AbstractCegarLoop]: === Iteration 951 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:19,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:19,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1441994501, now seen corresponding path program 944 times [2020-02-10 20:21:19,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:19,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137189951] [2020-02-10 20:21:19,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:19,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:19,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137189951] [2020-02-10 20:21:19,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:19,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:19,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887380345] [2020-02-10 20:21:19,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:19,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:19,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:19,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:19,871 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:20,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,018 INFO L93 Difference]: Finished difference Result 1192 states and 4212 transitions. [2020-02-10 20:21:20,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:20,018 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:20,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,022 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:21:20,022 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:21:20,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:20,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:21:20,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:21:20,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:20,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:20,043 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:20,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,043 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:20,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:20,043 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:20,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,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, 1, 1, 1] [2020-02-10 20:21:20,044 INFO L427 AbstractCegarLoop]: === Iteration 952 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,044 INFO L82 PathProgramCache]: Analyzing trace with hash -864752283, now seen corresponding path program 945 times [2020-02-10 20:21:20,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534078779] [2020-02-10 20:21:20,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534078779] [2020-02-10 20:21:20,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:20,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594837337] [2020-02-10 20:21:20,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:20,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:20,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:20,405 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:20,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:20,549 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:21:20,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:20,549 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:20,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:20,552 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:21:20,552 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:20,552 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:20,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:20,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:21:20,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:20,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:20,573 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:20,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:20,573 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:20,574 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:20,574 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:20,575 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:20,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, 1, 1, 1] [2020-02-10 20:21:20,575 INFO L427 AbstractCegarLoop]: === Iteration 953 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1399982085, now seen corresponding path program 946 times [2020-02-10 20:21:20,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:20,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862092485] [2020-02-10 20:21:20,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:20,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:20,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:20,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862092485] [2020-02-10 20:21:20,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:20,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:20,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605209217] [2020-02-10 20:21:20,942 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:20,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:20,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:20,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:20,943 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:21,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,089 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 20:21:21,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:21,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:21,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,093 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:21:21,093 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:21,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:21,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:21:21,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:21,115 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:21,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,115 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:21,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:21,115 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:21,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,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, 1, 1, 1] [2020-02-10 20:21:21,116 INFO L427 AbstractCegarLoop]: === Iteration 954 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,116 INFO L82 PathProgramCache]: Analyzing trace with hash -854249179, now seen corresponding path program 947 times [2020-02-10 20:21:21,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532682864] [2020-02-10 20:21:21,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:21,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:21,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532682864] [2020-02-10 20:21:21,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:21,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:21,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243932459] [2020-02-10 20:21:21,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:21,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:21,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:21,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:21,497 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:21,643 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 20:21:21,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:21,644 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:21,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:21,647 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:21:21,647 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:21:21,647 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:21:21,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:21:21,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:21,668 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:21,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:21,668 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:21,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:21,669 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:21,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:21,670 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:21,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, 1, 1, 1] [2020-02-10 20:21:21,670 INFO L427 AbstractCegarLoop]: === Iteration 955 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:21,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:21,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1294547357, now seen corresponding path program 948 times [2020-02-10 20:21:21,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:21,670 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191766118] [2020-02-10 20:21:21,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:21,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21: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 20:21:22,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191766118] [2020-02-10 20:21:22,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:22,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084897024] [2020-02-10 20:21:22,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:22,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:22,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:22,062 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:22,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,202 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:21:22,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:22,202 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:22,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,205 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:21:22,205 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:21:22,206 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:22,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:21:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:21:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:22,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:21:22,227 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:21:22,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,227 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:21:22,227 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:22,227 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:21:22,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:22,228 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,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, 1, 1, 1] [2020-02-10 20:21:22,228 INFO L427 AbstractCegarLoop]: === Iteration 956 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1567628061, now seen corresponding path program 949 times [2020-02-10 20:21:22,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274271662] [2020-02-10 20:21:22,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:22,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:22,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274271662] [2020-02-10 20:21:22,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:22,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:22,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830408331] [2020-02-10 20:21:22,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:22,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:22,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:22,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:22,597 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:21:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:22,731 INFO L93 Difference]: Finished difference Result 1209 states and 4253 transitions. [2020-02-10 20:21:22,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:22,731 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:22,734 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:21:22,734 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:21:22,735 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:22,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:21:22,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:21:22,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:21:22,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:21:22,756 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:21:22,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:22,756 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:21:22,756 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:22,756 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:21:22,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:22,757 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:22,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, 1, 1, 1] [2020-02-10 20:21:22,757 INFO L427 AbstractCegarLoop]: === Iteration 957 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:22,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:22,757 INFO L82 PathProgramCache]: Analyzing trace with hash 494542681, now seen corresponding path program 950 times [2020-02-10 20:21:22,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:22,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770692081] [2020-02-10 20:21:22,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:22,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770692081] [2020-02-10 20:21:23,167 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:23,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145727710] [2020-02-10 20:21:23,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:23,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:23,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:23,168 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:21:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,328 INFO L93 Difference]: Finished difference Result 1210 states and 4249 transitions. [2020-02-10 20:21:23,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:23,329 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,332 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:21:23,332 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:21:23,332 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:23,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:21:23,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 20:21:23,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:23,353 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:23,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,353 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:23,353 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:23,353 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:23,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:23,354 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,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, 1, 1, 1] [2020-02-10 20:21:23,354 INFO L427 AbstractCegarLoop]: === Iteration 958 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash 1061281795, now seen corresponding path program 951 times [2020-02-10 20:21:23,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623419742] [2020-02-10 20:21:23,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:23,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:23,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623419742] [2020-02-10 20:21:23,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:23,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:23,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148724858] [2020-02-10 20:21:23,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:23,710 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:23,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:23,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:23,711 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:23,853 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:21:23,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:23,854 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:23,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:23,857 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:21:23,857 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:21:23,857 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:23,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:21:23,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 777. [2020-02-10 20:21:23,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:23,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:23,879 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:23,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:23,879 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:23,879 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:23,879 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:23,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:23,880 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:23,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, 1, 1, 1] [2020-02-10 20:21:23,880 INFO L427 AbstractCegarLoop]: === Iteration 959 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:23,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:23,880 INFO L82 PathProgramCache]: Analyzing trace with hash 526051993, now seen corresponding path program 952 times [2020-02-10 20:21:23,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:23,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707891340] [2020-02-10 20:21:23,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707891340] [2020-02-10 20:21:24,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:24,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823824716] [2020-02-10 20:21:24,241 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:24,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:24,241 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:24,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,387 INFO L93 Difference]: Finished difference Result 1196 states and 4219 transitions. [2020-02-10 20:21:24,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:24,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:24,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,391 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:21:24,391 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:21:24,391 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:24,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:21:24,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 775. [2020-02-10 20:21:24,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:24,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:21:24,412 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:21:24,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,413 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:21:24,413 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:24,413 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:21:24,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:24,414 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,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, 1, 1, 1] [2020-02-10 20:21:24,414 INFO L427 AbstractCegarLoop]: === Iteration 960 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,414 INFO L82 PathProgramCache]: Analyzing trace with hash 1082288003, now seen corresponding path program 953 times [2020-02-10 20:21:24,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275432411] [2020-02-10 20:21:24,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:24,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:24,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275432411] [2020-02-10 20:21:24,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:24,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:24,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282936894] [2020-02-10 20:21:24,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:24,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:24,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:24,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:24,783 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:21:24,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:24,931 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 20:21:24,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:24,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:24,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:24,935 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:21:24,935 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:21:24,935 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:24,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:21:24,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:21:24,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:24,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:21:24,956 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:21:24,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:24,956 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:21:24,956 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:24,956 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:21:24,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:24,957 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:24,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:24,957 INFO L427 AbstractCegarLoop]: === Iteration 961 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:24,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:24,958 INFO L82 PathProgramCache]: Analyzing trace with hash 1620143581, now seen corresponding path program 954 times [2020-02-10 20:21:24,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:24,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260625751] [2020-02-10 20:21:24,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260625751] [2020-02-10 20:21:25,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:25,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400219287] [2020-02-10 20:21:25,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:25,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:25,330 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:21:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:25,485 INFO L93 Difference]: Finished difference Result 1197 states and 4219 transitions. [2020-02-10 20:21:25,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:25,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:25,488 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:21:25,489 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:21:25,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:25,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:21:25,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:21:25,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:25,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:21:25,510 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:21:25,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:25,510 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:21:25,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:25,510 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:21:25,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:25,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:25,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, 1, 1, 1] [2020-02-10 20:21:25,512 INFO L427 AbstractCegarLoop]: === Iteration 962 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:25,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:25,512 INFO L82 PathProgramCache]: Analyzing trace with hash -790802053, now seen corresponding path program 955 times [2020-02-10 20:21:25,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:25,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009317000] [2020-02-10 20:21:25,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:25,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:25,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009317000] [2020-02-10 20:21:25,893 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:25,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:25,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824940080] [2020-02-10 20:21:25,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:25,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:25,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:25,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:25,893 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:21:26,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,025 INFO L93 Difference]: Finished difference Result 1194 states and 4215 transitions. [2020-02-10 20:21:26,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:26,025 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,028 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:21:26,028 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:21:26,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:26,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:21:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 778. [2020-02-10 20:21:26,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:21:26,050 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,050 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:21:26,050 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:26,050 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:21:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:26,051 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,051 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:26,052 INFO L427 AbstractCegarLoop]: === Iteration 963 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 820138905, now seen corresponding path program 956 times [2020-02-10 20:21:26,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371193076] [2020-02-10 20:21:26,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:26,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:26,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371193076] [2020-02-10 20:21:26,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:26,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:26,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132250019] [2020-02-10 20:21:26,411 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:26,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:26,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:26,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:26,412 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:26,552 INFO L93 Difference]: Finished difference Result 1198 states and 4220 transitions. [2020-02-10 20:21:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:26,553 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:26,556 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:21:26,556 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:21:26,556 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:26,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:21:26,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 775. [2020-02-10 20:21:26,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:26,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:21:26,578 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:21:26,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:26,578 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:21:26,578 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:26,578 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:21:26,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:26,579 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:26,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, 1, 1, 1] [2020-02-10 20:21:26,579 INFO L427 AbstractCegarLoop]: === Iteration 964 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:26,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1297148319, now seen corresponding path program 957 times [2020-02-10 20:21:26,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:26,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418641068] [2020-02-10 20:21:26,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:26,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:26,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418641068] [2020-02-10 20:21:26,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:26,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:26,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554529537] [2020-02-10 20:21:26,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:26,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:26,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:26,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:26,950 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:21:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,080 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 20:21:27,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:27,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,084 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:21:27,084 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:27,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:27,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:27,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:21:27,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:27,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:21:27,106 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:21:27,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,106 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:21:27,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:27,106 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:21:27,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:27,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,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, 1, 1, 1] [2020-02-10 20:21:27,107 INFO L427 AbstractCegarLoop]: === Iteration 965 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,108 INFO L82 PathProgramCache]: Analyzing trace with hash 851648217, now seen corresponding path program 958 times [2020-02-10 20:21:27,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558519189] [2020-02-10 20:21:27,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:27,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 20:21:27,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558519189] [2020-02-10 20:21:27,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:27,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:27,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983244705] [2020-02-10 20:21:27,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:27,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:27,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:27,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:27,476 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:21:27,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:27,616 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 20:21:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:27,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:27,620 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:21:27,620 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:21:27,620 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:21:27,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:21:27,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:27,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:21:27,643 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:21:27,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:27,643 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:21:27,643 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:27,643 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:21:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:27,644 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:27,644 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:27,644 INFO L427 AbstractCegarLoop]: === Iteration 966 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:27,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1286645215, now seen corresponding path program 959 times [2020-02-10 20:21:27,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:27,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680882001] [2020-02-10 20:21:27,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680882001] [2020-02-10 20:21:28,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:28,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875763135] [2020-02-10 20:21:28,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:28,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:28,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:28,014 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:21:28,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,149 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 20:21:28,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:28,150 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:28,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,153 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:21:28,153 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:21:28,154 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:28,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:21:28,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:21:28,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:28,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:21:28,175 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:21:28,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,175 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:21:28,175 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:28,175 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:21:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:28,176 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,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, 1, 1, 1] [2020-02-10 20:21:28,176 INFO L427 AbstractCegarLoop]: === Iteration 967 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,176 INFO L82 PathProgramCache]: Analyzing trace with hash -748789637, now seen corresponding path program 960 times [2020-02-10 20:21:28,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439790557] [2020-02-10 20:21:28,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:28,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:28,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439790557] [2020-02-10 20:21:28,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:28,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:28,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723477278] [2020-02-10 20:21:28,546 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:28,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:28,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:28,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:28,546 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:21:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:28,688 INFO L93 Difference]: Finished difference Result 1191 states and 4202 transitions. [2020-02-10 20:21:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:28,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:28,692 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:21:28,692 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:28,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:28,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:28,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 769. [2020-02-10 20:21:28,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:21:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3074 transitions. [2020-02-10 20:21:28,713 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3074 transitions. Word has length 25 [2020-02-10 20:21:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:28,714 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3074 transitions. [2020-02-10 20:21:28,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:28,714 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3074 transitions. [2020-02-10 20:21:28,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:28,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:28,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, 1, 1, 1] [2020-02-10 20:21:28,715 INFO L427 AbstractCegarLoop]: === Iteration 968 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:28,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:28,715 INFO L82 PathProgramCache]: Analyzing trace with hash 377256515, now seen corresponding path program 961 times [2020-02-10 20:21:28,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:28,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301253331] [2020-02-10 20:21:28,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:29,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301253331] [2020-02-10 20:21:29,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:29,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:29,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724714973] [2020-02-10 20:21:29,095 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:29,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:29,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:29,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:29,095 INFO L87 Difference]: Start difference. First operand 769 states and 3074 transitions. Second operand 10 states. [2020-02-10 20:21:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,231 INFO L93 Difference]: Finished difference Result 1207 states and 4273 transitions. [2020-02-10 20:21:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:29,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,235 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:21:29,235 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:21:29,235 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:29,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:21:29,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:21:29,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:21:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3117 transitions. [2020-02-10 20:21:29,257 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3117 transitions. Word has length 25 [2020-02-10 20:21:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,257 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3117 transitions. [2020-02-10 20:21:29,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3117 transitions. [2020-02-10 20:21:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:29,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,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, 1, 1, 1] [2020-02-10 20:21:29,258 INFO L427 AbstractCegarLoop]: === Iteration 969 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1347508129, now seen corresponding path program 962 times [2020-02-10 20:21:29,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443717868] [2020-02-10 20:21:29,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:29,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:29,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443717868] [2020-02-10 20:21:29,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:29,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:29,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301835445] [2020-02-10 20:21:29,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:29,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:29,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:29,637 INFO L87 Difference]: Start difference. First operand 781 states and 3117 transitions. Second operand 10 states. [2020-02-10 20:21:29,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:29,790 INFO L93 Difference]: Finished difference Result 1209 states and 4273 transitions. [2020-02-10 20:21:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:29,790 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:29,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:29,803 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:21:29,803 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:21:29,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:29,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:21:29,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:21:29,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:29,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3107 transitions. [2020-02-10 20:21:29,824 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3107 transitions. Word has length 25 [2020-02-10 20:21:29,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:29,824 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3107 transitions. [2020-02-10 20:21:29,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:29,824 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3107 transitions. [2020-02-10 20:21:29,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:29,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:29,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, 1, 1, 1] [2020-02-10 20:21:29,825 INFO L427 AbstractCegarLoop]: === Iteration 970 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:29,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:29,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1991676703, now seen corresponding path program 963 times [2020-02-10 20:21:29,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:29,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242663525] [2020-02-10 20:21:29,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:30,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242663525] [2020-02-10 20:21:30,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:30,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812609261] [2020-02-10 20:21:30,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:30,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:30,218 INFO L87 Difference]: Start difference. First operand 777 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:21:30,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,361 INFO L93 Difference]: Finished difference Result 1203 states and 4261 transitions. [2020-02-10 20:21:30,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:30,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:30,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,364 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:21:30,364 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:21:30,365 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:30,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:21:30,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:21:30,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:30,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3112 transitions. [2020-02-10 20:21:30,386 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3112 transitions. Word has length 25 [2020-02-10 20:21:30,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,386 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3112 transitions. [2020-02-10 20:21:30,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:30,386 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3112 transitions. [2020-02-10 20:21:30,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:30,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,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, 1, 1, 1] [2020-02-10 20:21:30,388 INFO L427 AbstractCegarLoop]: === Iteration 971 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,388 INFO L82 PathProgramCache]: Analyzing trace with hash -1010921985, now seen corresponding path program 964 times [2020-02-10 20:21:30,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,388 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913774641] [2020-02-10 20:21:30,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:30,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 20:21:30,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913774641] [2020-02-10 20:21:30,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:30,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:30,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573267999] [2020-02-10 20:21:30,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:30,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:30,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:30,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:30,781 INFO L87 Difference]: Start difference. First operand 780 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:21:30,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:30,922 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 20:21:30,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:30,923 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:30,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:30,926 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:21:30,926 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:21:30,926 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:30,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:21:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 20:21:30,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:30,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3104 transitions. [2020-02-10 20:21:30,948 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3104 transitions. Word has length 25 [2020-02-10 20:21:30,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:30,948 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3104 transitions. [2020-02-10 20:21:30,948 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3104 transitions. [2020-02-10 20:21:30,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:30,949 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:30,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, 1, 1, 1] [2020-02-10 20:21:30,949 INFO L427 AbstractCegarLoop]: === Iteration 972 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:30,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:30,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1686133315, now seen corresponding path program 965 times [2020-02-10 20:21:30,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:30,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486097803] [2020-02-10 20:21:30,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:30,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:31,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486097803] [2020-02-10 20:21:31,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:31,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390394295] [2020-02-10 20:21:31,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:31,327 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:31,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:31,327 INFO L87 Difference]: Start difference. First operand 777 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:21:31,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:31,465 INFO L93 Difference]: Finished difference Result 1207 states and 4266 transitions. [2020-02-10 20:21:31,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:31,466 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:31,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:31,469 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:21:31,469 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:31,469 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:31,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:31,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 20:21:31,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:31,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:21:31,490 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:21:31,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:31,490 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:21:31,490 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:31,490 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:21:31,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:31,491 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:31,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, 1, 1, 1] [2020-02-10 20:21:31,491 INFO L427 AbstractCegarLoop]: === Iteration 973 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:31,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash -997893023, now seen corresponding path program 966 times [2020-02-10 20:21:31,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:31,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480843858] [2020-02-10 20:21:31,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:31,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 20:21:31,874 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480843858] [2020-02-10 20:21:31,874 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:31,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:31,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844125053] [2020-02-10 20:21:31,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:31,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:31,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:31,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:31,875 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:21:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:32,019 INFO L93 Difference]: Finished difference Result 1204 states and 4257 transitions. [2020-02-10 20:21:32,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:32,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,022 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:21:32,022 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:21:32,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:32,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:21:32,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 20:21:32,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:21:32,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3096 transitions. [2020-02-10 20:21:32,043 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:32,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,043 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3096 transitions. [2020-02-10 20:21:32,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:32,043 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3096 transitions. [2020-02-10 20:21:32,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:32,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,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, 1, 1, 1] [2020-02-10 20:21:32,044 INFO L427 AbstractCegarLoop]: === Iteration 974 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,045 INFO L82 PathProgramCache]: Analyzing trace with hash -467714937, now seen corresponding path program 967 times [2020-02-10 20:21:32,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315492489] [2020-02-10 20:21:32,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:32,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:32,428 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315492489] [2020-02-10 20:21:32,428 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:32,428 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:32,429 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96547205] [2020-02-10 20:21:32,429 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:32,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:32,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:32,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:32,429 INFO L87 Difference]: Start difference. First operand 774 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:32,560 INFO L93 Difference]: Finished difference Result 1213 states and 4287 transitions. [2020-02-10 20:21:32,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:32,561 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:32,564 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:21:32,564 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:21:32,564 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:32,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:21:32,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 782. [2020-02-10 20:21:32,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:21:32,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3118 transitions. [2020-02-10 20:21:32,585 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3118 transitions. Word has length 25 [2020-02-10 20:21:32,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:32,586 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3118 transitions. [2020-02-10 20:21:32,586 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:32,586 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3118 transitions. [2020-02-10 20:21:32,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:32,587 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:32,587 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:32,587 INFO L427 AbstractCegarLoop]: === Iteration 975 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:32,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:32,587 INFO L82 PathProgramCache]: Analyzing trace with hash 502536677, now seen corresponding path program 968 times [2020-02-10 20:21:32,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:32,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670671502] [2020-02-10 20:21:32,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:32,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670671502] [2020-02-10 20:21:32,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:32,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:32,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199153446] [2020-02-10 20:21:32,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:32,977 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:32,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:32,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:32,977 INFO L87 Difference]: Start difference. First operand 782 states and 3118 transitions. Second operand 10 states. [2020-02-10 20:21:33,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,115 INFO L93 Difference]: Finished difference Result 1215 states and 4287 transitions. [2020-02-10 20:21:33,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:33,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:33,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,119 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:21:33,119 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:21:33,119 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:33,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:21:33,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 778. [2020-02-10 20:21:33,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:33,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3107 transitions. [2020-02-10 20:21:33,140 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3107 transitions. Word has length 25 [2020-02-10 20:21:33,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,140 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3107 transitions. [2020-02-10 20:21:33,140 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:33,141 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3107 transitions. [2020-02-10 20:21:33,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:33,141 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:33,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, 1, 1, 1] [2020-02-10 20:21:33,142 INFO L427 AbstractCegarLoop]: === Iteration 976 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,142 INFO L82 PathProgramCache]: Analyzing trace with hash 1015420001, now seen corresponding path program 969 times [2020-02-10 20:21:33,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721725633] [2020-02-10 20:21:33,142 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:33,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 20:21:33,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721725633] [2020-02-10 20:21:33,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:33,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:33,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620542754] [2020-02-10 20:21:33,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:33,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:33,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:33,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:33,536 INFO L87 Difference]: Start difference. First operand 778 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:21:33,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:33,675 INFO L93 Difference]: Finished difference Result 1212 states and 4281 transitions. [2020-02-10 20:21:33,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:33,675 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:33,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:33,678 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:21:33,678 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:21:33,679 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:33,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:21:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 782. [2020-02-10 20:21:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:21:33,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3114 transitions. [2020-02-10 20:21:33,711 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3114 transitions. Word has length 25 [2020-02-10 20:21:33,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:33,711 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3114 transitions. [2020-02-10 20:21:33,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:33,711 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3114 transitions. [2020-02-10 20:21:33,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:33,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21: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, 1, 1, 1] [2020-02-10 20:21:33,713 INFO L427 AbstractCegarLoop]: === Iteration 977 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:33,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:33,713 INFO L82 PathProgramCache]: Analyzing trace with hash 2017180927, now seen corresponding path program 970 times [2020-02-10 20:21:33,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:33,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631344325] [2020-02-10 20:21:33,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:33,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631344325] [2020-02-10 20:21:34,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:34,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437174242] [2020-02-10 20:21:34,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:34,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:34,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:34,102 INFO L87 Difference]: Start difference. First operand 782 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:21:34,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:34,245 INFO L93 Difference]: Finished difference Result 1213 states and 4279 transitions. [2020-02-10 20:21:34,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:34,246 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:34,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:34,249 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:21:34,249 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:21:34,250 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:34,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:21:34,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 778. [2020-02-10 20:21:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3103 transitions. [2020-02-10 20:21:34,271 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3103 transitions. Word has length 25 [2020-02-10 20:21:34,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:34,271 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3103 transitions. [2020-02-10 20:21:34,271 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:34,271 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3103 transitions. [2020-02-10 20:21:34,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:34,272 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:34,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, 1, 1, 1] [2020-02-10 20:21:34,273 INFO L427 AbstractCegarLoop]: === Iteration 978 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:34,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:34,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1492354311, now seen corresponding path program 971 times [2020-02-10 20:21:34,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:34,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654786230] [2020-02-10 20:21:34,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:34,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:34,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:34,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654786230] [2020-02-10 20:21:34,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:34,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:34,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783819718] [2020-02-10 20:21:34,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:34,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:34,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:34,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:34,665 INFO L87 Difference]: Start difference. First operand 778 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:21:34,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:34,813 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 20:21:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:34,813 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:34,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:34,817 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:21:34,817 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:21:34,817 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:21:34,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 783. [2020-02-10 20:21:34,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:21:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:21:34,838 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:21:34,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:34,838 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:21:34,838 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:34,838 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:21:34,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:34,839 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:34,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, 1, 1, 1] [2020-02-10 20:21:34,839 INFO L427 AbstractCegarLoop]: === Iteration 979 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:34,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:34,839 INFO L82 PathProgramCache]: Analyzing trace with hash 2030209889, now seen corresponding path program 972 times [2020-02-10 20:21:34,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:34,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013287688] [2020-02-10 20:21:34,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013287688] [2020-02-10 20:21:35,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:35,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535901785] [2020-02-10 20:21:35,237 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:35,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:35,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:35,237 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:21:35,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,374 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:21:35,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:35,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:35,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,378 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:21:35,378 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:21:35,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:35,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:21:35,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 774. [2020-02-10 20:21:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:21:35,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3093 transitions. [2020-02-10 20:21:35,400 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3093 transitions. Word has length 25 [2020-02-10 20:21:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,400 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3093 transitions. [2020-02-10 20:21:35,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:35,400 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3093 transitions. [2020-02-10 20:21:35,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:35,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,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, 1, 1, 1] [2020-02-10 20:21:35,402 INFO L427 AbstractCegarLoop]: === Iteration 980 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1035833415, now seen corresponding path program 973 times [2020-02-10 20:21:35,402 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681703953] [2020-02-10 20:21:35,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:35,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681703953] [2020-02-10 20:21:35,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:35,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:35,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345229510] [2020-02-10 20:21:35,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:35,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:35,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:35,791 INFO L87 Difference]: Start difference. First operand 774 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:21:35,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:35,950 INFO L93 Difference]: Finished difference Result 1202 states and 4256 transitions. [2020-02-10 20:21:35,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:35,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:35,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:35,954 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:21:35,954 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:21:35,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:21:35,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 780. [2020-02-10 20:21:35,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:35,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:21:35,975 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:21:35,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:35,975 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:21:35,976 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:35,976 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:21:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:35,977 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:35,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, 1, 1, 1] [2020-02-10 20:21:35,977 INFO L427 AbstractCegarLoop]: === Iteration 981 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:35,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:35,977 INFO L82 PathProgramCache]: Analyzing trace with hash 2016588133, now seen corresponding path program 974 times [2020-02-10 20:21:35,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:35,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968811433] [2020-02-10 20:21:35,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:35,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:36,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:36,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968811433] [2020-02-10 20:21:36,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:36,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:36,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249494374] [2020-02-10 20:21:36,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:36,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:36,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:36,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:36,378 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:21:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:36,517 INFO L93 Difference]: Finished difference Result 1201 states and 4251 transitions. [2020-02-10 20:21:36,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:36,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:36,521 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:21:36,521 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:21:36,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:21:36,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 777. [2020-02-10 20:21:36,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:36,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:21:36,542 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:21:36,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:36,542 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:21:36,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:36,542 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:21:36,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:36,543 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:36,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, 1, 1, 1] [2020-02-10 20:21:36,543 INFO L427 AbstractCegarLoop]: === Iteration 982 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash 592934275, now seen corresponding path program 975 times [2020-02-10 20:21:36,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634065395] [2020-02-10 20:21:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:36,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:36,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634065395] [2020-02-10 20:21:36,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:36,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:36,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9308848] [2020-02-10 20:21:36,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:36,939 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:36,939 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:36,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:36,939 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:21:37,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:37,089 INFO L93 Difference]: Finished difference Result 1205 states and 4260 transitions. [2020-02-10 20:21:37,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:37,090 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:37,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:37,093 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:21:37,093 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:37,093 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:37,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:37,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 20:21:37,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:21:37,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:21:37,115 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:21:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:37,115 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:21:37,115 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:37,115 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:21:37,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:37,116 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:37,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, 1, 1, 1] [2020-02-10 20:21:37,116 INFO L427 AbstractCegarLoop]: === Iteration 983 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:37,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:37,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1594695201, now seen corresponding path program 976 times [2020-02-10 20:21:37,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:37,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316866385] [2020-02-10 20:21:37,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:37,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:37,510 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316866385] [2020-02-10 20:21:37,510 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:37,510 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:37,510 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955121296] [2020-02-10 20:21:37,510 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:37,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:37,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:37,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:37,510 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:21:37,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:37,673 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 20:21:37,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:37,674 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:37,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:37,677 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:21:37,677 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:21:37,677 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:37,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:21:37,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:21:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:37,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:21:37,711 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:37,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:37,711 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:21:37,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:37,711 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:21:37,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:37,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:37,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, 1, 1, 1] [2020-02-10 20:21:37,712 INFO L427 AbstractCegarLoop]: === Iteration 984 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:37,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:37,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1288561529, now seen corresponding path program 977 times [2020-02-10 20:21:37,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:37,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329001444] [2020-02-10 20:21:37,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:37,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:38,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329001444] [2020-02-10 20:21:38,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:38,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:38,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195330191] [2020-02-10 20:21:38,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:38,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:38,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:38,098 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,255 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 20:21:38,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:38,255 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:38,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,258 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:21:38,258 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:21:38,258 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:38,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:21:38,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:21:38,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:38,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:21:38,279 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:21:38,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,279 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:21:38,279 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:38,279 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:21:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:38,280 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,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, 1, 1, 1] [2020-02-10 20:21:38,280 INFO L427 AbstractCegarLoop]: === Iteration 985 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1933320387, now seen corresponding path program 978 times [2020-02-10 20:21:38,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677576817] [2020-02-10 20:21:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:38,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677576817] [2020-02-10 20:21:38,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:38,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:38,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302823003] [2020-02-10 20:21:38,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:38,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:38,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:38,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:38,668 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:21:38,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:38,835 INFO L93 Difference]: Finished difference Result 1204 states and 4251 transitions. [2020-02-10 20:21:38,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:38,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:38,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:38,839 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:21:38,839 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:21:38,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:38,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:21:38,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 774. [2020-02-10 20:21:38,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:21:38,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3090 transitions. [2020-02-10 20:21:38,861 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3090 transitions. Word has length 25 [2020-02-10 20:21:38,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:38,861 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3090 transitions. [2020-02-10 20:21:38,861 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:38,861 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3090 transitions. [2020-02-10 20:21:38,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:38,862 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:38,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, 1, 1, 1] [2020-02-10 20:21:38,862 INFO L427 AbstractCegarLoop]: === Iteration 986 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:38,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:38,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1989258399, now seen corresponding path program 979 times [2020-02-10 20:21:38,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:38,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814398956] [2020-02-10 20:21:38,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814398956] [2020-02-10 20:21:39,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:39,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832148800] [2020-02-10 20:21:39,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:39,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:39,247 INFO L87 Difference]: Start difference. First operand 774 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:21:39,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:39,384 INFO L93 Difference]: Finished difference Result 1209 states and 4268 transitions. [2020-02-10 20:21:39,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:39,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:39,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:39,387 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:21:39,387 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:21:39,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:39,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:21:39,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 780. [2020-02-10 20:21:39,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:39,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3106 transitions. [2020-02-10 20:21:39,409 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3106 transitions. Word has length 25 [2020-02-10 20:21:39,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:39,409 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3106 transitions. [2020-02-10 20:21:39,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:39,409 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3106 transitions. [2020-02-10 20:21:39,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:39,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:39,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, 1, 1, 1] [2020-02-10 20:21:39,410 INFO L427 AbstractCegarLoop]: === Iteration 987 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:39,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:39,411 INFO L82 PathProgramCache]: Analyzing trace with hash -378317441, now seen corresponding path program 980 times [2020-02-10 20:21:39,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:39,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826673315] [2020-02-10 20:21:39,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:39,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826673315] [2020-02-10 20:21:39,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:39,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:39,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069807356] [2020-02-10 20:21:39,793 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:39,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:39,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:39,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:39,793 INFO L87 Difference]: Start difference. First operand 780 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:21:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:39,962 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 20:21:39,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:39,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:39,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:39,965 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:21:39,965 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:21:39,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:39,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:21:39,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:21:39,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:39,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:21:39,985 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:39,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:39,986 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:21:39,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:39,986 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:21:39,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:39,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:39,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, 1, 1, 1] [2020-02-10 20:21:39,987 INFO L427 AbstractCegarLoop]: === Iteration 988 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:39,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:39,987 INFO L82 PathProgramCache]: Analyzing trace with hash -895166811, now seen corresponding path program 981 times [2020-02-10 20:21:39,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:39,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417602759] [2020-02-10 20:21:39,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417602759] [2020-02-10 20:21:40,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:40,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916986806] [2020-02-10 20:21:40,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:40,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:40,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:40,370 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:40,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:40,504 INFO L93 Difference]: Finished difference Result 1213 states and 4275 transitions. [2020-02-10 20:21:40,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:40,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:40,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:40,507 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:21:40,507 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:21:40,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:40,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:21:40,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:21:40,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:21:40,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:21:40,528 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:21:40,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:40,528 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:21:40,528 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:40,528 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:21:40,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:40,529 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:40,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, 1, 1, 1] [2020-02-10 20:21:40,530 INFO L427 AbstractCegarLoop]: === Iteration 989 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:40,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:40,530 INFO L82 PathProgramCache]: Analyzing trace with hash -357311233, now seen corresponding path program 982 times [2020-02-10 20:21:40,530 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:40,530 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164504642] [2020-02-10 20:21:40,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:40,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:40,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:40,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164504642] [2020-02-10 20:21:40,920 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:40,920 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:40,920 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669777889] [2020-02-10 20:21:40,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:40,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:40,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:40,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:40,921 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:21:41,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,082 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:21:41,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:41,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:41,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,085 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:21:41,085 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:21:41,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:41,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:21:41,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:21:41,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:41,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:21:41,106 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:21:41,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,106 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:21:41,106 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:41,106 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:21:41,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:41,107 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,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, 1, 1, 1] [2020-02-10 20:21:41,108 INFO L427 AbstractCegarLoop]: === Iteration 990 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,108 INFO L82 PathProgramCache]: Analyzing trace with hash -884663707, now seen corresponding path program 983 times [2020-02-10 20:21:41,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097992451] [2020-02-10 20:21:41,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:41,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:41,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097992451] [2020-02-10 20:21:41,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:41,484 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:41,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608217812] [2020-02-10 20:21:41,484 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:41,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:41,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:41,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:41,485 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:21:41,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:41,623 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 20:21:41,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:41,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:41,627 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:21:41,627 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:21:41,627 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:41,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:21:41,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 20:21:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:41,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:21:41,648 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:41,649 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:21:41,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:41,649 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:21:41,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:41,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:41,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, 1, 1, 1] [2020-02-10 20:21:41,650 INFO L427 AbstractCegarLoop]: === Iteration 991 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:41,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1957749087, now seen corresponding path program 984 times [2020-02-10 20:21:41,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:41,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767172771] [2020-02-10 20:21:41,650 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:41,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:42,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767172771] [2020-02-10 20:21:42,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:42,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:42,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59004361] [2020-02-10 20:21:42,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:42,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:42,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:42,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:42,045 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:42,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:42,222 INFO L93 Difference]: Finished difference Result 1207 states and 4255 transitions. [2020-02-10 20:21:42,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:42,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:42,225 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:21:42,225 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:21:42,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:42,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:21:42,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 771. [2020-02-10 20:21:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:21:42,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3083 transitions. [2020-02-10 20:21:42,246 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3083 transitions. Word has length 25 [2020-02-10 20:21:42,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:42,246 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3083 transitions. [2020-02-10 20:21:42,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:42,246 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3083 transitions. [2020-02-10 20:21:42,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:42,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:42,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:42,247 INFO L427 AbstractCegarLoop]: === Iteration 992 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:42,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:42,247 INFO L82 PathProgramCache]: Analyzing trace with hash -47054721, now seen corresponding path program 985 times [2020-02-10 20:21:42,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:42,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397549251] [2020-02-10 20:21:42,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:42,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397549251] [2020-02-10 20:21:42,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:42,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:42,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613574485] [2020-02-10 20:21:42,616 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:42,616 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:42,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:42,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:42,617 INFO L87 Difference]: Start difference. First operand 771 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:21:42,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:42,755 INFO L93 Difference]: Finished difference Result 1193 states and 4226 transitions. [2020-02-10 20:21:42,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:42,755 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:42,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:42,758 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:21:42,758 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:21:42,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:21:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 780. [2020-02-10 20:21:42,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:21:42,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3110 transitions. [2020-02-10 20:21:42,780 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3110 transitions. Word has length 25 [2020-02-10 20:21:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:42,780 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3110 transitions. [2020-02-10 20:21:42,780 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:42,780 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3110 transitions. [2020-02-10 20:21:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:42,781 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:42,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, 1, 1, 1] [2020-02-10 20:21:42,781 INFO L427 AbstractCegarLoop]: === Iteration 993 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:42,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:42,781 INFO L82 PathProgramCache]: Analyzing trace with hash 923196893, now seen corresponding path program 986 times [2020-02-10 20:21:42,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:42,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251723226] [2020-02-10 20:21:42,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:42,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251723226] [2020-02-10 20:21:43,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:43,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108963967] [2020-02-10 20:21:43,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:43,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:43,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:43,154 INFO L87 Difference]: Start difference. First operand 780 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:21:43,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,309 INFO L93 Difference]: Finished difference Result 1195 states and 4226 transitions. [2020-02-10 20:21:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:43,309 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:43,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,313 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:21:43,313 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:43,313 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:43,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:43,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:21:43,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:43,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3100 transitions. [2020-02-10 20:21:43,334 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:43,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:43,334 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3100 transitions. [2020-02-10 20:21:43,334 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:43,334 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3100 transitions. [2020-02-10 20:21:43,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:43,335 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:43,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, 1, 1, 1] [2020-02-10 20:21:43,335 INFO L427 AbstractCegarLoop]: === Iteration 994 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:43,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:43,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1878979357, now seen corresponding path program 987 times [2020-02-10 20:21:43,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:43,336 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956608095] [2020-02-10 20:21:43,336 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956608095] [2020-02-10 20:21:43,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:43,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:43,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430740418] [2020-02-10 20:21:43,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:43,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:43,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:43,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:43,719 INFO L87 Difference]: Start difference. First operand 776 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:43,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:43,878 INFO L93 Difference]: Finished difference Result 1189 states and 4214 transitions. [2020-02-10 20:21:43,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:43,879 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:43,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:43,882 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:21:43,882 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:43,882 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:43,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:43,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:21:43,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:43,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:21:43,903 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:21:43,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:43,903 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:21:43,903 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:43,903 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:21:43,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:43,904 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:43,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, 1, 1, 1] [2020-02-10 20:21:43,904 INFO L427 AbstractCegarLoop]: === Iteration 995 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:43,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:43,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1435233221, now seen corresponding path program 988 times [2020-02-10 20:21:43,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:43,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333674395] [2020-02-10 20:21:43,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:44,288 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333674395] [2020-02-10 20:21:44,288 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:44,288 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:44,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122525813] [2020-02-10 20:21:44,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:44,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:44,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:44,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:44,288 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:21:44,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:44,471 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 20:21:44,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:44,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:44,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:44,474 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:21:44,474 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:21:44,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:21:44,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 20:21:44,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:21:44,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3097 transitions. [2020-02-10 20:21:44,495 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3097 transitions. Word has length 25 [2020-02-10 20:21:44,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:44,496 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3097 transitions. [2020-02-10 20:21:44,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:44,496 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3097 transitions. [2020-02-10 20:21:44,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:44,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:44,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, 1, 1, 1] [2020-02-10 20:21:44,497 INFO L427 AbstractCegarLoop]: === Iteration 996 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:44,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:44,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1261822079, now seen corresponding path program 989 times [2020-02-10 20:21:44,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:44,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178574139] [2020-02-10 20:21:44,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:44,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:44,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 20:21:44,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178574139] [2020-02-10 20:21:44,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:44,873 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:44,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071516203] [2020-02-10 20:21:44,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:44,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:44,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:44,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:44,874 INFO L87 Difference]: Start difference. First operand 776 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:21:45,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:45,048 INFO L93 Difference]: Finished difference Result 1193 states and 4219 transitions. [2020-02-10 20:21:45,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:45,049 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:45,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:45,052 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:21:45,052 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:21:45,052 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:45,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:21:45,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 779. [2020-02-10 20:21:45,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:45,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:21:45,073 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:21:45,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:45,073 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:21:45,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:21:45,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:45,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:45,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, 1, 1, 1] [2020-02-10 20:21:45,075 INFO L427 AbstractCegarLoop]: === Iteration 997 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:45,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1422204259, now seen corresponding path program 990 times [2020-02-10 20:21:45,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:45,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876295564] [2020-02-10 20:21:45,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:45,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:45,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:45,452 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876295564] [2020-02-10 20:21:45,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:45,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:45,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471115936] [2020-02-10 20:21:45,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:45,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:45,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:45,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:45,453 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:21:45,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:45,648 INFO L93 Difference]: Finished difference Result 1190 states and 4210 transitions. [2020-02-10 20:21:45,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:45,649 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:45,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:45,652 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:21:45,652 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:45,652 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:45,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:45,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:21:45,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:45,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3090 transitions. [2020-02-10 20:21:45,673 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3090 transitions. Word has length 25 [2020-02-10 20:21:45,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:45,673 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3090 transitions. [2020-02-10 20:21:45,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:45,673 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3090 transitions. [2020-02-10 20:21:45,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:45,674 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:45,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, 1, 1, 1] [2020-02-10 20:21:45,674 INFO L427 AbstractCegarLoop]: === Iteration 998 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:45,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:45,675 INFO L82 PathProgramCache]: Analyzing trace with hash -1736997625, now seen corresponding path program 991 times [2020-02-10 20:21:45,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:45,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495005642] [2020-02-10 20:21:45,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495005642] [2020-02-10 20:21:46,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:46,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831731166] [2020-02-10 20:21:46,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:46,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:46,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:46,067 INFO L87 Difference]: Start difference. First operand 773 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:21:46,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,214 INFO L93 Difference]: Finished difference Result 1189 states and 4212 transitions. [2020-02-10 20:21:46,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:46,215 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:46,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,217 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:21:46,217 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:21:46,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:46,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:21:46,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:21:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:46,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:21:46,238 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:21:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,238 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:21:46,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:46,238 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:21:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:46,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,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, 1, 1, 1] [2020-02-10 20:21:46,239 INFO L427 AbstractCegarLoop]: === Iteration 999 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,239 INFO L82 PathProgramCache]: Analyzing trace with hash -766746011, now seen corresponding path program 992 times [2020-02-10 20:21:46,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497860719] [2020-02-10 20:21:46,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:46,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:46,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497860719] [2020-02-10 20:21:46,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:46,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:46,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302397827] [2020-02-10 20:21:46,609 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:46,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:46,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:46,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:46,609 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:21:46,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:46,760 INFO L93 Difference]: Finished difference Result 1191 states and 4212 transitions. [2020-02-10 20:21:46,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:46,760 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:46,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:46,763 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:21:46,763 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:46,764 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:46,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:46,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 775. [2020-02-10 20:21:46,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:46,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3095 transitions. [2020-02-10 20:21:46,785 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3095 transitions. Word has length 25 [2020-02-10 20:21:46,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:46,785 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3095 transitions. [2020-02-10 20:21:46,785 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:46,785 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3095 transitions. [2020-02-10 20:21:46,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:46,786 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:46,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, 1, 1, 1] [2020-02-10 20:21:46,786 INFO L427 AbstractCegarLoop]: === Iteration 1000 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:46,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:46,786 INFO L82 PathProgramCache]: Analyzing trace with hash -696761827, now seen corresponding path program 993 times [2020-02-10 20:21:46,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:46,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075580576] [2020-02-10 20:21:46,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,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 20:21:47,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075580576] [2020-02-10 20:21:47,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:47,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56300257] [2020-02-10 20:21:47,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:47,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:47,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:47,157 INFO L87 Difference]: Start difference. First operand 775 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:21:47,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,324 INFO L93 Difference]: Finished difference Result 1183 states and 4196 transitions. [2020-02-10 20:21:47,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:47,324 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:47,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,327 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:21:47,328 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:21:47,328 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:47,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:21:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:21:47,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:47,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3098 transitions. [2020-02-10 20:21:47,348 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:47,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,348 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3098 transitions. [2020-02-10 20:21:47,349 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:47,349 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3098 transitions. [2020-02-10 20:21:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:47,349 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,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, 1, 1, 1] [2020-02-10 20:21:47,350 INFO L427 AbstractCegarLoop]: === Iteration 1001 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,350 INFO L82 PathProgramCache]: Analyzing trace with hash 326005307, now seen corresponding path program 994 times [2020-02-10 20:21:47,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579298383] [2020-02-10 20:21:47,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:47,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:47,725 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579298383] [2020-02-10 20:21:47,725 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:47,725 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:47,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51832673] [2020-02-10 20:21:47,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:47,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:47,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:47,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:47,726 INFO L87 Difference]: Start difference. First operand 777 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:47,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:47,886 INFO L93 Difference]: Finished difference Result 1181 states and 4190 transitions. [2020-02-10 20:21:47,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:47,887 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:47,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:47,890 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:21:47,890 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:21:47,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:47,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:21:47,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:21:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:47,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:21:47,911 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:21:47,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:47,911 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:21:47,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:47,911 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:21:47,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:47,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:47,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, 1, 1, 1] [2020-02-10 20:21:47,912 INFO L427 AbstractCegarLoop]: === Iteration 1002 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:47,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:47,913 INFO L82 PathProgramCache]: Analyzing trace with hash 874264071, now seen corresponding path program 995 times [2020-02-10 20:21:47,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:47,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012433082] [2020-02-10 20:21:47,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:47,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:48,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 20:21:48,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012433082] [2020-02-10 20:21:48,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:48,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:48,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926084267] [2020-02-10 20:21:48,277 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:48,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:48,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:48,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:48,277 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:21:48,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,421 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:21:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:48,422 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:48,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,425 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:21:48,425 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:48,425 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:48,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:48,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:21:48,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:21:48,446 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,446 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:21:48,446 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:48,446 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:21:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:48,447 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,447 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:48,448 INFO L427 AbstractCegarLoop]: === Iteration 1003 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 339034269, now seen corresponding path program 996 times [2020-02-10 20:21:48,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438434175] [2020-02-10 20:21:48,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:48,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:48,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438434175] [2020-02-10 20:21:48,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:48,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:48,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328879802] [2020-02-10 20:21:48,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:48,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:48,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:48,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:48,815 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:48,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:48,960 INFO L93 Difference]: Finished difference Result 1183 states and 4192 transitions. [2020-02-10 20:21:48,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:48,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:48,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:48,963 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:21:48,963 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:21:48,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:48,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:21:48,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 20:21:48,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:48,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:21:48,985 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:21:48,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:48,985 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:21:48,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:48,985 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:21:48,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:48,986 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:48,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, 1, 1, 1] [2020-02-10 20:21:48,986 INFO L427 AbstractCegarLoop]: === Iteration 1004 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:48,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:48,986 INFO L82 PathProgramCache]: Analyzing trace with hash -233449273, now seen corresponding path program 997 times [2020-02-10 20:21:48,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:48,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845906206] [2020-02-10 20:21:48,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845906206] [2020-02-10 20:21:49,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:49,372 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845907686] [2020-02-10 20:21:49,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:49,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:49,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:49,372 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:21:49,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:49,541 INFO L93 Difference]: Finished difference Result 1181 states and 4192 transitions. [2020-02-10 20:21:49,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:49,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:49,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:49,545 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:21:49,545 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:21:49,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:49,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:21:49,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 20:21:49,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:49,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:21:49,566 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:21:49,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:49,567 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:21:49,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:49,567 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:21:49,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:49,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:49,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:49,568 INFO L427 AbstractCegarLoop]: === Iteration 1005 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:49,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:49,568 INFO L82 PathProgramCache]: Analyzing trace with hash 747305445, now seen corresponding path program 998 times [2020-02-10 20:21:49,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:49,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351248623] [2020-02-10 20:21:49,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:49,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:49,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:49,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351248623] [2020-02-10 20:21:49,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:49,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:49,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411612557] [2020-02-10 20:21:49,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:49,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:49,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:49,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:49,975 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:21:50,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,114 INFO L93 Difference]: Finished difference Result 1180 states and 4187 transitions. [2020-02-10 20:21:50,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:50,115 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:50,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,118 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:21:50,118 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:21:50,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:50,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:21:50,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 20:21:50,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:50,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:21:50,138 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:21:50,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,139 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:21:50,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:50,139 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:21:50,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:50,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,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, 1, 1, 1] [2020-02-10 20:21:50,140 INFO L427 AbstractCegarLoop]: === Iteration 1006 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1119247553, now seen corresponding path program 999 times [2020-02-10 20:21:50,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549808028] [2020-02-10 20:21:50,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:50,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:50,521 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549808028] [2020-02-10 20:21:50,521 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:50,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:50,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385899626] [2020-02-10 20:21:50,522 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:50,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:50,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:50,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:50,522 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:21:50,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:50,680 INFO L93 Difference]: Finished difference Result 1179 states and 4185 transitions. [2020-02-10 20:21:50,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:50,680 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:50,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:50,683 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:21:50,684 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:21:50,684 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:21:50,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:21:50,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:50,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:21:50,705 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:21:50,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:50,705 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:21:50,705 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:50,705 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:21:50,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:50,706 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:50,706 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:50,706 INFO L427 AbstractCegarLoop]: === Iteration 1007 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:50,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:50,706 INFO L82 PathProgramCache]: Analyzing trace with hash -96480419, now seen corresponding path program 1000 times [2020-02-10 20:21:50,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:50,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761808482] [2020-02-10 20:21:50,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:50,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:51,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:51,093 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761808482] [2020-02-10 20:21:51,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:51,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:51,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202039720] [2020-02-10 20:21:51,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:51,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:51,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:51,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:51,094 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:21:51,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,233 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 20:21:51,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:51,234 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:51,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,237 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:21:51,237 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:21:51,237 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:51,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:21:51,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:21:51,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:51,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:51,258 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:51,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,258 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:51,258 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:51,258 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:51,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:51,259 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,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, 1, 1, 1] [2020-02-10 20:21:51,259 INFO L427 AbstractCegarLoop]: === Iteration 1008 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,259 INFO L82 PathProgramCache]: Analyzing trace with hash -1906651769, now seen corresponding path program 1001 times [2020-02-10 20:21:51,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565781294] [2020-02-10 20:21:51,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:51,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:51,652 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565781294] [2020-02-10 20:21:51,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:51,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:51,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270792074] [2020-02-10 20:21:51,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:51,652 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:51,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:51,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:51,653 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:51,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:51,800 INFO L93 Difference]: Finished difference Result 1177 states and 4179 transitions. [2020-02-10 20:21:51,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:51,800 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:51,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:51,803 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:21:51,803 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:21:51,803 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:51,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:21:51,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:21:51,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:51,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:51,824 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:51,824 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:51,824 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:51,825 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:51,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:51,825 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:51,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, 1, 1, 1] [2020-02-10 20:21:51,826 INFO L427 AbstractCegarLoop]: === Iteration 1009 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:51,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:51,826 INFO L82 PathProgramCache]: Analyzing trace with hash 242144767, now seen corresponding path program 1002 times [2020-02-10 20:21:51,826 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:51,826 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957176261] [2020-02-10 20:21:51,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957176261] [2020-02-10 20:21:52,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:52,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343415197] [2020-02-10 20:21:52,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:52,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:52,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:52,211 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:52,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,384 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:21:52,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:52,384 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:52,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,387 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:21:52,387 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:21:52,388 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:21:52,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 20:21:52,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:52,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:21:52,408 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:21:52,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,409 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:21:52,409 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:52,409 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:21:52,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:52,410 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,410 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:52,410 INFO L427 AbstractCegarLoop]: === Iteration 1010 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,410 INFO L82 PathProgramCache]: Analyzing trace with hash 593527069, now seen corresponding path program 1003 times [2020-02-10 20:21:52,410 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,410 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010227145] [2020-02-10 20:21:52,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:52,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010227145] [2020-02-10 20:21:52,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:52,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:52,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771718207] [2020-02-10 20:21:52,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:52,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:52,792 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:21:52,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:52,958 INFO L93 Difference]: Finished difference Result 1187 states and 4202 transitions. [2020-02-10 20:21:52,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:52,959 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:52,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:52,962 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:21:52,962 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:21:52,962 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:52,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:21:52,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:21:52,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:21:52,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:21:52,983 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:21:52,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:52,984 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:21:52,984 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:52,984 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:21:52,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:52,985 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:52,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, 1, 1, 1] [2020-02-10 20:21:52,985 INFO L427 AbstractCegarLoop]: === Iteration 1011 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:52,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:52,985 INFO L82 PathProgramCache]: Analyzing trace with hash -2090499269, now seen corresponding path program 1004 times [2020-02-10 20:21:52,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:52,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221275579] [2020-02-10 20:21:52,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:53,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:53,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221275579] [2020-02-10 20:21:53,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:53,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:53,369 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930804939] [2020-02-10 20:21:53,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:53,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:53,370 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:21:53,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:53,527 INFO L93 Difference]: Finished difference Result 1184 states and 4193 transitions. [2020-02-10 20:21:53,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:53,527 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:53,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:53,530 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:21:53,531 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:21:53,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:53,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:21:53,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:21:53,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:53,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:21:53,552 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:21:53,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:53,552 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:21:53,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:53,552 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:21:53,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:53,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:53,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, 1, 1, 1] [2020-02-10 20:21:53,553 INFO L427 AbstractCegarLoop]: === Iteration 1012 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:53,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:53,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1513257051, now seen corresponding path program 1005 times [2020-02-10 20:21:53,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:53,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767532802] [2020-02-10 20:21:53,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:53,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:53,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767532802] [2020-02-10 20:21:53,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:53,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:53,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181581064] [2020-02-10 20:21:53,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:53,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:53,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:53,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:53,926 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:21:54,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:54,085 INFO L93 Difference]: Finished difference Result 1185 states and 4195 transitions. [2020-02-10 20:21:54,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:54,086 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:54,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:54,089 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:21:54,089 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:21:54,089 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:54,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:21:54,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:21:54,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:54,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:21:54,111 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:21:54,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:54,111 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:21:54,111 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:54,111 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:21:54,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:54,112 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:54,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, 1, 1, 1] [2020-02-10 20:21:54,112 INFO L427 AbstractCegarLoop]: === Iteration 1013 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:54,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:54,112 INFO L82 PathProgramCache]: Analyzing trace with hash -2048486853, now seen corresponding path program 1006 times [2020-02-10 20:21:54,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:54,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695317086] [2020-02-10 20:21:54,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:54,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:54,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695317086] [2020-02-10 20:21:54,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:54,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:54,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602982484] [2020-02-10 20:21:54,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:54,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:54,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:54,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:54,495 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:21:54,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:54,660 INFO L93 Difference]: Finished difference Result 1181 states and 4185 transitions. [2020-02-10 20:21:54,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:54,661 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:54,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:54,664 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:21:54,664 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:21:54,664 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:54,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:21:54,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:21:54,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:21:54,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:21:54,686 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:21:54,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:54,686 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:21:54,686 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:54,686 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:21:54,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:54,687 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:54,687 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:21:54,687 INFO L427 AbstractCegarLoop]: === Iteration 1014 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:54,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:54,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1502753947, now seen corresponding path program 1007 times [2020-02-10 20:21:54,687 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:54,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681080529] [2020-02-10 20:21:54,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:54,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:55,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:55,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681080529] [2020-02-10 20:21:55,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:55,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:55,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644217870] [2020-02-10 20:21:55,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:55,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:55,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:55,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:55,068 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:21:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,224 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:21:55,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:55,225 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,228 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:21:55,228 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:21:55,228 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:55,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:21:55,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:21:55,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:55,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:21:55,250 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:21:55,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,250 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:21:55,250 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:55,250 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:21:55,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:55,251 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,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, 1, 1, 1] [2020-02-10 20:21:55,251 INFO L427 AbstractCegarLoop]: === Iteration 1015 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,251 INFO L82 PathProgramCache]: Analyzing trace with hash 646042589, now seen corresponding path program 1008 times [2020-02-10 20:21:55,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387873315] [2020-02-10 20:21:55,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:55,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 20:21:55,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387873315] [2020-02-10 20:21:55,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:55,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:55,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200676239] [2020-02-10 20:21:55,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:55,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:55,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:55,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:55,633 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:21:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:55,805 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 20:21:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:55,806 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:55,809 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:21:55,809 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:21:55,809 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:55,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:21:55,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 20:21:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:21:55,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:21:55,831 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:21:55,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:55,831 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:21:55,831 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:55,831 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:21:55,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:55,832 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:55,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, 1, 1, 1] [2020-02-10 20:21:55,832 INFO L427 AbstractCegarLoop]: === Iteration 1016 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:55,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:55,833 INFO L82 PathProgramCache]: Analyzing trace with hash -1316337409, now seen corresponding path program 1009 times [2020-02-10 20:21:55,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:55,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433749112] [2020-02-10 20:21:55,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:55,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433749112] [2020-02-10 20:21:56,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:56,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574171616] [2020-02-10 20:21:56,210 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:56,210 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:56,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:56,210 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:21:56,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,353 INFO L93 Difference]: Finished difference Result 1205 states and 4258 transitions. [2020-02-10 20:21:56,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:56,354 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:56,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,357 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:21:56,357 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:21:56,357 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:56,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:21:56,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 781. [2020-02-10 20:21:56,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:21:56,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 20:21:56,377 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 20:21:56,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,378 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 20:21:56,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:56,378 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 20:21:56,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:56,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,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, 1, 1, 1] [2020-02-10 20:21:56,379 INFO L427 AbstractCegarLoop]: === Iteration 1017 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,379 INFO L82 PathProgramCache]: Analyzing trace with hash -346085795, now seen corresponding path program 1010 times [2020-02-10 20:21:56,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74528953] [2020-02-10 20:21:56,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:56,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:56,770 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74528953] [2020-02-10 20:21:56,770 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:56,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:56,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588645379] [2020-02-10 20:21:56,771 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:56,771 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:56,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:56,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:56,771 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:21:56,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:56,928 INFO L93 Difference]: Finished difference Result 1207 states and 4258 transitions. [2020-02-10 20:21:56,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:56,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:56,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:56,932 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:21:56,932 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:21:56,932 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:56,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:21:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:21:56,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:56,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:21:56,952 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:21:56,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:56,953 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:21:56,953 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:56,953 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:21:56,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:56,954 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:56,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, 1, 1, 1] [2020-02-10 20:21:56,954 INFO L427 AbstractCegarLoop]: === Iteration 1018 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:56,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:56,954 INFO L82 PathProgramCache]: Analyzing trace with hash 166797529, now seen corresponding path program 1011 times [2020-02-10 20:21:56,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:56,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865022159] [2020-02-10 20:21:56,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865022159] [2020-02-10 20:21:57,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:57,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929455537] [2020-02-10 20:21:57,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:57,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:57,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:57,343 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:21:57,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:57,483 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:21:57,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:57,483 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:57,486 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:21:57,486 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:21:57,486 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:57,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:21:57,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 781. [2020-02-10 20:21:57,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:21:57,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:21:57,507 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:21:57,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:57,507 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:21:57,507 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:57,507 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:21:57,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:57,508 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:57,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, 1, 1, 1] [2020-02-10 20:21:57,508 INFO L427 AbstractCegarLoop]: === Iteration 1019 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:57,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:57,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1168558455, now seen corresponding path program 1012 times [2020-02-10 20:21:57,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:57,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703932689] [2020-02-10 20:21:57,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:57,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:57,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:57,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703932689] [2020-02-10 20:21:57,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481207791] [2020-02-10 20:21:57,900 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:57,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:57,901 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:21:58,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,069 INFO L93 Difference]: Finished difference Result 1205 states and 4250 transitions. [2020-02-10 20:21:58,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:58,069 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:58,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,072 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:21:58,072 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:21:58,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:58,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:21:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 777. [2020-02-10 20:21:58,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:21:58,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:21:58,093 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:21:58,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,093 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:21:58,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:58,093 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:21:58,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:58,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,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, 1, 1, 1] [2020-02-10 20:21:58,094 INFO L427 AbstractCegarLoop]: === Iteration 1020 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,095 INFO L82 PathProgramCache]: Analyzing trace with hash 643731839, now seen corresponding path program 1013 times [2020-02-10 20:21:58,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133081111] [2020-02-10 20:21:58,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:58,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:58,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133081111] [2020-02-10 20:21:58,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:58,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:58,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602285104] [2020-02-10 20:21:58,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:58,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:58,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:58,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:58,486 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:21:58,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:58,636 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 20:21:58,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:58,636 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:58,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:58,640 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:21:58,640 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:21:58,640 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:58,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:21:58,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 782. [2020-02-10 20:21:58,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:21:58,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3106 transitions. [2020-02-10 20:21:58,661 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3106 transitions. Word has length 25 [2020-02-10 20:21:58,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:58,661 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3106 transitions. [2020-02-10 20:21:58,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:58,661 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3106 transitions. [2020-02-10 20:21:58,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:58,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:58,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, 1, 1, 1] [2020-02-10 20:21:58,662 INFO L427 AbstractCegarLoop]: === Iteration 1021 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:58,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:58,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1181587417, now seen corresponding path program 1014 times [2020-02-10 20:21:58,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:58,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77646144] [2020-02-10 20:21:58,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:58,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77646144] [2020-02-10 20:21:59,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:59,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424112238] [2020-02-10 20:21:59,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:59,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:59,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:59,045 INFO L87 Difference]: Start difference. First operand 782 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:21:59,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,190 INFO L93 Difference]: Finished difference Result 1208 states and 4252 transitions. [2020-02-10 20:21:59,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:59,190 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:59,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,193 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:21:59,194 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:21:59,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:59,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:21:59,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 773. [2020-02-10 20:21:59,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:21:59,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:21:59,214 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:21:59,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,214 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:21:59,215 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:59,215 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:21:59,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:59,216 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,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, 1, 1, 1] [2020-02-10 20:21:59,216 INFO L427 AbstractCegarLoop]: === Iteration 1022 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,216 INFO L82 PathProgramCache]: Analyzing trace with hash 2133658435, now seen corresponding path program 1015 times [2020-02-10 20:21:59,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760926604] [2020-02-10 20:21:59,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:21:59,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:21:59,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760926604] [2020-02-10 20:21:59,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:21:59,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:21:59,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064893688] [2020-02-10 20:21:59,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:21:59,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:21:59,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:21:59,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:21:59,584 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:21:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:21:59,755 INFO L93 Difference]: Finished difference Result 1195 states and 4227 transitions. [2020-02-10 20:21:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:21:59,756 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:21:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:21:59,759 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:21:59,759 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:21:59,759 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:21:59,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:21:59,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:21:59,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:21:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:21:59,780 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:21:59,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:21:59,780 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:21:59,781 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:21:59,781 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:21:59,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:21:59,782 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:21:59,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, 1, 1, 1] [2020-02-10 20:21:59,782 INFO L427 AbstractCegarLoop]: === Iteration 1023 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:21:59,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:21:59,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1191057247, now seen corresponding path program 1016 times [2020-02-10 20:21:59,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:21:59,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137069900] [2020-02-10 20:21:59,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:21:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:00,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:00,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137069900] [2020-02-10 20:22:00,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:00,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:00,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987013662] [2020-02-10 20:22:00,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:00,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:00,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:00,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:00,156 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:22:00,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,315 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 20:22:00,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:00,315 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:00,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,319 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:22:00,319 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:22:00,319 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:00,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:22:00,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:22:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:22:00,340 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:22:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,340 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:22:00,340 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:00,340 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:22:00,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:00,341 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,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, 1, 1, 1] [2020-02-10 20:22:00,341 INFO L427 AbstractCegarLoop]: === Iteration 1024 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1121073063, now seen corresponding path program 1017 times [2020-02-10 20:22:00,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694734594] [2020-02-10 20:22:00,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:00,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:00,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694734594] [2020-02-10 20:22:00,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:00,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:00,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605296949] [2020-02-10 20:22:00,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:00,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:00,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:00,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:00,739 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:22:00,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:00,883 INFO L93 Difference]: Finished difference Result 1189 states and 4211 transitions. [2020-02-10 20:22:00,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:00,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:00,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:00,887 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:22:00,887 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:22:00,887 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:00,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:22:00,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:22:00,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:00,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:22:00,910 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:22:00,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:00,910 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:22:00,910 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:00,910 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:22:00,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:00,911 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:00,911 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:00,911 INFO L427 AbstractCegarLoop]: === Iteration 1025 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:00,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:00,911 INFO L82 PathProgramCache]: Analyzing trace with hash -98305929, now seen corresponding path program 1018 times [2020-02-10 20:22:00,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:00,911 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188947223] [2020-02-10 20:22:00,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:01,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:01,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188947223] [2020-02-10 20:22:01,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:01,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506330374] [2020-02-10 20:22:01,287 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:01,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:01,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:01,288 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:22:01,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:01,470 INFO L93 Difference]: Finished difference Result 1187 states and 4205 transitions. [2020-02-10 20:22:01,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:01,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:01,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:01,474 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:01,474 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:22:01,474 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:01,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:22:01,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:22:01,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:01,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:22:01,496 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:01,496 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:22:01,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:22:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:01,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:01,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, 1, 1, 1] [2020-02-10 20:22:01,497 INFO L427 AbstractCegarLoop]: === Iteration 1026 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:01,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:01,497 INFO L82 PathProgramCache]: Analyzing trace with hash 449952835, now seen corresponding path program 1019 times [2020-02-10 20:22:01,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:01,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498797143] [2020-02-10 20:22:01,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22: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 20:22:01,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498797143] [2020-02-10 20:22:01,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:01,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:01,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137616568] [2020-02-10 20:22:01,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:01,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:01,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:01,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:01,869 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:02,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:02,019 INFO L93 Difference]: Finished difference Result 1193 states and 4217 transitions. [2020-02-10 20:22:02,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:02,020 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:02,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:02,023 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:22:02,023 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:22:02,023 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:02,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:22:02,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:22:02,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:02,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:22:02,044 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:02,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:02,045 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:22:02,045 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:02,045 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:22:02,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:02,046 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:02,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, 1, 1, 1] [2020-02-10 20:22:02,046 INFO L427 AbstractCegarLoop]: === Iteration 1027 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:02,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:02,046 INFO L82 PathProgramCache]: Analyzing trace with hash -85276967, now seen corresponding path program 1020 times [2020-02-10 20:22:02,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:02,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084283364] [2020-02-10 20:22:02,046 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:02,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 20:22:02,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084283364] [2020-02-10 20:22:02,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:02,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:02,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163775422] [2020-02-10 20:22:02,431 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:02,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:02,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:02,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:02,431 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:02,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:02,626 INFO L93 Difference]: Finished difference Result 1189 states and 4207 transitions. [2020-02-10 20:22:02,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:02,627 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:02,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:02,630 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:22:02,630 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:22:02,631 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:02,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:22:02,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:22:02,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:02,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:22:02,652 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:22:02,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:02,653 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:22:02,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:02,653 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:22:02,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:02,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:02,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, 1, 1, 1] [2020-02-10 20:22:02,654 INFO L427 AbstractCegarLoop]: === Iteration 1028 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:02,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:02,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1945631101, now seen corresponding path program 1021 times [2020-02-10 20:22:02,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:02,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493715864] [2020-02-10 20:22:02,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:02,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:03,036 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493715864] [2020-02-10 20:22:03,036 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,036 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:03,036 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474891138] [2020-02-10 20:22:03,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:03,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:03,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:03,037 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:22:03,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,197 INFO L93 Difference]: Finished difference Result 1193 states and 4221 transitions. [2020-02-10 20:22:03,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:03,198 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:03,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,201 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:22:03,201 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:22:03,201 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:22:03,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 20:22:03,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:22:03,223 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:22:03,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,223 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:22:03,223 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:03,223 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:22:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:03,224 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,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, 1, 1, 1] [2020-02-10 20:22:03,224 INFO L427 AbstractCegarLoop]: === Iteration 1029 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,224 INFO L82 PathProgramCache]: Analyzing trace with hash -943870175, now seen corresponding path program 1022 times [2020-02-10 20:22:03,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454877272] [2020-02-10 20:22:03,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:03,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 20:22:03,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454877272] [2020-02-10 20:22:03,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:03,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:03,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902731086] [2020-02-10 20:22:03,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:03,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:03,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:03,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:03,601 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:22:03,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:03,796 INFO L93 Difference]: Finished difference Result 1194 states and 4219 transitions. [2020-02-10 20:22:03,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:03,797 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:03,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:03,800 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:22:03,800 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:22:03,800 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:03,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:22:03,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:22:03,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:03,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:22:03,821 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:03,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:03,821 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:22:03,821 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:03,822 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:22:03,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:03,822 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:03,823 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:03,823 INFO L427 AbstractCegarLoop]: === Iteration 1030 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:03,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:03,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1906437055, now seen corresponding path program 1023 times [2020-02-10 20:22:03,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:03,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938748982] [2020-02-10 20:22:03,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22: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 20:22:04,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938748982] [2020-02-10 20:22:04,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:04,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098069022] [2020-02-10 20:22:04,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:04,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:04,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:04,198 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:04,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,352 INFO L93 Difference]: Finished difference Result 1188 states and 4207 transitions. [2020-02-10 20:22:04,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:04,353 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:04,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,356 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:22:04,356 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:22:04,356 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:04,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:22:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:22:04,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:04,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:22:04,378 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:04,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,378 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:22:04,378 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:04,378 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:22:04,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:04,379 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,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, 1, 1, 1] [2020-02-10 20:22:04,379 INFO L427 AbstractCegarLoop]: === Iteration 1031 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1365763107, now seen corresponding path program 1024 times [2020-02-10 20:22:04,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050765037] [2020-02-10 20:22:04,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:04,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 20:22:04,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050765037] [2020-02-10 20:22:04,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:04,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:04,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163375512] [2020-02-10 20:22:04,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:04,755 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:04,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:04,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:04,755 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:04,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:04,937 INFO L93 Difference]: Finished difference Result 1186 states and 4201 transitions. [2020-02-10 20:22:04,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:04,937 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:04,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:04,940 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:04,941 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:22:04,941 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:04,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:22:04,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:22:04,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:04,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:04,962 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:04,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:04,962 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:04,962 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:04,962 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:04,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:04,963 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:04,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, 1, 1, 1] [2020-02-10 20:22:04,963 INFO L427 AbstractCegarLoop]: === Iteration 1032 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:04,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:04,964 INFO L82 PathProgramCache]: Analyzing trace with hash 697139907, now seen corresponding path program 1025 times [2020-02-10 20:22:04,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:04,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060948081] [2020-02-10 20:22:04,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:05,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:05,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060948081] [2020-02-10 20:22:05,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:05,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:05,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023896458] [2020-02-10 20:22:05,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:05,339 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:05,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:05,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:05,339 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:05,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:05,496 INFO L93 Difference]: Finished difference Result 1190 states and 4209 transitions. [2020-02-10 20:22:05,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:05,496 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:05,499 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:22:05,499 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:22:05,500 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:05,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:22:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:22:05,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:05,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:05,521 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:05,521 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:05,521 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:05,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:05,522 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:05,522 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:05,522 INFO L427 AbstractCegarLoop]: === Iteration 1033 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash -375945473, now seen corresponding path program 1026 times [2020-02-10 20:22:05,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:05,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116217] [2020-02-10 20:22:05,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:05,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:05,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116217] [2020-02-10 20:22:05,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:05,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:05,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613995643] [2020-02-10 20:22:05,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:05,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:05,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:05,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:05,898 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:06,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,075 INFO L93 Difference]: Finished difference Result 1187 states and 4201 transitions. [2020-02-10 20:22:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:06,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:06,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,078 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:06,079 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:22:06,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:06,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:22:06,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:22:06,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:06,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:22:06,100 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:22:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,100 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:22:06,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:06,100 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:22:06,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:06,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,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, 1, 1, 1] [2020-02-10 20:22:06,102 INFO L427 AbstractCegarLoop]: === Iteration 1034 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,102 INFO L82 PathProgramCache]: Analyzing trace with hash -24563171, now seen corresponding path program 1027 times [2020-02-10 20:22:06,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277229013] [2020-02-10 20:22:06,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:06,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:06,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277229013] [2020-02-10 20:22:06,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:06,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:06,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005463835] [2020-02-10 20:22:06,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:06,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:06,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:06,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:06,484 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:22:06,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:06,684 INFO L93 Difference]: Finished difference Result 1201 states and 4237 transitions. [2020-02-10 20:22:06,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:06,684 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:06,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:06,688 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:22:06,688 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:22:06,688 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:06,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:22:06,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:22:06,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:22:06,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3100 transitions. [2020-02-10 20:22:06,710 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3100 transitions. Word has length 25 [2020-02-10 20:22:06,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:06,711 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3100 transitions. [2020-02-10 20:22:06,711 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:06,711 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3100 transitions. [2020-02-10 20:22:06,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:06,712 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:06,712 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:06,712 INFO L427 AbstractCegarLoop]: === Iteration 1035 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:06,712 INFO L82 PathProgramCache]: Analyzing trace with hash 513292407, now seen corresponding path program 1028 times [2020-02-10 20:22:06,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:06,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488351207] [2020-02-10 20:22:06,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:06,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488351207] [2020-02-10 20:22:07,089 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,089 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:07,089 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703247308] [2020-02-10 20:22:07,089 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:07,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:07,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:07,089 INFO L87 Difference]: Start difference. First operand 780 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:22:07,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:07,234 INFO L93 Difference]: Finished difference Result 1200 states and 4230 transitions. [2020-02-10 20:22:07,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:07,235 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:07,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:07,238 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:22:07,238 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:22:07,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:22:07,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:22:07,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:07,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:07,260 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:07,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:07,260 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:07,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:07,260 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:07,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:07,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:07,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, 1, 1, 1] [2020-02-10 20:22:07,261 INFO L427 AbstractCegarLoop]: === Iteration 1036 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:07,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:07,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1069528417, now seen corresponding path program 1029 times [2020-02-10 20:22:07,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:07,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17416761] [2020-02-10 20:22:07,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:07,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17416761] [2020-02-10 20:22:07,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:07,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:07,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592573032] [2020-02-10 20:22:07,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:07,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:07,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:07,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:07,620 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:07,810 INFO L93 Difference]: Finished difference Result 1195 states and 4220 transitions. [2020-02-10 20:22:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:07,810 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:07,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:07,813 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:22:07,813 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:22:07,813 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:22:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:22:07,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:07,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:07,834 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:07,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:07,835 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:07,835 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:07,835 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:07,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:07,836 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:07,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, 1, 1, 1] [2020-02-10 20:22:07,836 INFO L427 AbstractCegarLoop]: === Iteration 1037 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:07,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:07,836 INFO L82 PathProgramCache]: Analyzing trace with hash 534298615, now seen corresponding path program 1030 times [2020-02-10 20:22:07,836 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:07,836 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080261608] [2020-02-10 20:22:07,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,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 20:22:08,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080261608] [2020-02-10 20:22:08,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:08,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304711533] [2020-02-10 20:22:08,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:08,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:08,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:08,192 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,381 INFO L93 Difference]: Finished difference Result 1191 states and 4210 transitions. [2020-02-10 20:22:08,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:08,382 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:08,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,385 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:22:08,385 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:22:08,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:08,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:22:08,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:22:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:22:08,407 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:22:08,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,407 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:22:08,407 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:08,407 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:22:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:08,408 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,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, 1, 1, 1] [2020-02-10 20:22:08,408 INFO L427 AbstractCegarLoop]: === Iteration 1038 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1101037729, now seen corresponding path program 1031 times [2020-02-10 20:22:08,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504329447] [2020-02-10 20:22:08,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:08,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 20:22:08,775 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504329447] [2020-02-10 20:22:08,775 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:08,775 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:08,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737708022] [2020-02-10 20:22:08,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:08,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:08,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:08,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:08,776 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:22:08,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:08,966 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:22:08,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:08,967 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:08,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:08,970 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:22:08,970 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:22:08,970 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:22:08,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 20:22:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:08,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:22:08,991 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:08,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:08,991 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:22:08,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:08,991 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:22:08,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:08,992 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:08,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, 1, 1, 1] [2020-02-10 20:22:08,992 INFO L427 AbstractCegarLoop]: === Iteration 1039 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:08,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:08,993 INFO L82 PathProgramCache]: Analyzing trace with hash 27952349, now seen corresponding path program 1032 times [2020-02-10 20:22:08,993 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:08,993 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519015013] [2020-02-10 20:22:08,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:08,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519015013] [2020-02-10 20:22:09,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:09,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385213814] [2020-02-10 20:22:09,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:09,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:09,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:09,364 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:09,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:09,562 INFO L93 Difference]: Finished difference Result 1190 states and 4206 transitions. [2020-02-10 20:22:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:09,562 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:09,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:09,565 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:22:09,565 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:22:09,566 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:22:09,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 771. [2020-02-10 20:22:09,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:22:09,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:22:09,586 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:22:09,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:09,587 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:22:09,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:22:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:09,588 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:09,588 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:09,588 INFO L427 AbstractCegarLoop]: === Iteration 1040 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:09,588 INFO L82 PathProgramCache]: Analyzing trace with hash -24944675, now seen corresponding path program 1033 times [2020-02-10 20:22:09,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:09,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683723897] [2020-02-10 20:22:09,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:09,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:09,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683723897] [2020-02-10 20:22:09,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:09,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:09,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133010501] [2020-02-10 20:22:09,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:09,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:09,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:09,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:09,987 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:22:10,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:10,176 INFO L93 Difference]: Finished difference Result 1187 states and 4209 transitions. [2020-02-10 20:22:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:10,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:10,179 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:10,180 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:22:10,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:10,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:22:10,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 20:22:10,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:22:10,201 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:22:10,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,201 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:22:10,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:10,201 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:22:10,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:10,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,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, 1, 1, 1] [2020-02-10 20:22:10,202 INFO L427 AbstractCegarLoop]: === Iteration 1041 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,203 INFO L82 PathProgramCache]: Analyzing trace with hash 955810043, now seen corresponding path program 1034 times [2020-02-10 20:22:10,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094877117] [2020-02-10 20:22:10,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:10,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:10,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094877117] [2020-02-10 20:22:10,598 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:10,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:10,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606443802] [2020-02-10 20:22:10,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:10,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:10,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:10,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:10,599 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:22:10,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:10,787 INFO L93 Difference]: Finished difference Result 1186 states and 4204 transitions. [2020-02-10 20:22:10,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:10,788 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:10,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:10,791 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:10,791 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:22:10,791 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:10,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:22:10,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 776. [2020-02-10 20:22:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:22:10,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:22:10,812 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:22:10,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:10,812 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:22:10,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:10,812 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:22:10,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:10,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:10,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, 1, 1, 1] [2020-02-10 20:22:10,813 INFO L427 AbstractCegarLoop]: === Iteration 1042 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:10,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:10,813 INFO L82 PathProgramCache]: Analyzing trace with hash -467843815, now seen corresponding path program 1035 times [2020-02-10 20:22:10,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:10,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608615067] [2020-02-10 20:22:10,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:10,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:11,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608615067] [2020-02-10 20:22:11,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:11,223 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383367201] [2020-02-10 20:22:11,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:11,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:11,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:11,224 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:22:11,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,409 INFO L93 Difference]: Finished difference Result 1190 states and 4213 transitions. [2020-02-10 20:22:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:11,409 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:11,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,413 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:22:11,413 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:22:11,413 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:11,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:22:11,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 780. [2020-02-10 20:22:11,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:22:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:22:11,434 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:22:11,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,434 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:22:11,434 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:11,434 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:22:11,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:11,435 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:11,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, 1, 1, 1] [2020-02-10 20:22:11,435 INFO L427 AbstractCegarLoop]: === Iteration 1043 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:11,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:11,436 INFO L82 PathProgramCache]: Analyzing trace with hash 533917111, now seen corresponding path program 1036 times [2020-02-10 20:22:11,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:11,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924750864] [2020-02-10 20:22:11,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:11,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:11,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 20:22:11,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924750864] [2020-02-10 20:22:11,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:11,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:11,826 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987223806] [2020-02-10 20:22:11,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:11,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:11,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:11,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:11,827 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:22:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:11,973 INFO L93 Difference]: Finished difference Result 1191 states and 4211 transitions. [2020-02-10 20:22:11,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:11,974 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:11,977 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:22:11,977 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:22:11,977 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:22:11,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 776. [2020-02-10 20:22:11,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:22:11,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:22:11,999 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:22:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:11,999 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:22:11,999 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:11,999 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:22:12,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:12,000 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:12,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, 1, 1, 1] [2020-02-10 20:22:12,000 INFO L427 AbstractCegarLoop]: === Iteration 1044 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:12,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:12,001 INFO L82 PathProgramCache]: Analyzing trace with hash 1945627677, now seen corresponding path program 1037 times [2020-02-10 20:22:12,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:12,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865210110] [2020-02-10 20:22:12,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:12,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865210110] [2020-02-10 20:22:12,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:12,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:12,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031901153] [2020-02-10 20:22:12,386 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:12,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:12,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:12,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:12,387 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:22:12,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:12,577 INFO L93 Difference]: Finished difference Result 1187 states and 4203 transitions. [2020-02-10 20:22:12,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:12,577 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:12,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:12,581 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:12,581 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:22:12,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:12,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:22:12,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 20:22:12,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:12,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:22:12,603 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:22:12,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:12,603 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:22:12,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:12,603 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:22:12,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:12,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:12,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, 1, 1, 1] [2020-02-10 20:22:12,604 INFO L427 AbstractCegarLoop]: === Iteration 1045 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:12,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:12,604 INFO L82 PathProgramCache]: Analyzing trace with hash 872542297, now seen corresponding path program 1038 times [2020-02-10 20:22:12,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:12,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973887784] [2020-02-10 20:22:12,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:12,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:12,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:12,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973887784] [2020-02-10 20:22:12,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:12,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:12,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174249553] [2020-02-10 20:22:12,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:12,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:12,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:12,986 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:22:13,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,177 INFO L93 Difference]: Finished difference Result 1189 states and 4204 transitions. [2020-02-10 20:22:13,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:13,177 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:13,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,180 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:22:13,180 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:13,181 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:13,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:13,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 773. [2020-02-10 20:22:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:13,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:22:13,202 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:22:13,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,202 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:22:13,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:22:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:13,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,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, 1, 1, 1] [2020-02-10 20:22:13,203 INFO L427 AbstractCegarLoop]: === Iteration 1046 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,203 INFO L82 PathProgramCache]: Analyzing trace with hash -869916127, now seen corresponding path program 1039 times [2020-02-10 20:22:13,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566248667] [2020-02-10 20:22:13,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:13,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:13,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566248667] [2020-02-10 20:22:13,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:13,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:13,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509865714] [2020-02-10 20:22:13,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:13,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:13,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:13,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:13,597 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:22:13,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:13,783 INFO L93 Difference]: Finished difference Result 1180 states and 4188 transitions. [2020-02-10 20:22:13,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:13,783 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:13,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:13,787 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:22:13,787 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:22:13,787 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:13,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:22:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 778. [2020-02-10 20:22:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:22:13,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:22:13,808 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:22:13,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:13,808 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:22:13,808 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:13,808 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:22:13,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:13,809 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:13,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, 1, 1, 1] [2020-02-10 20:22:13,809 INFO L427 AbstractCegarLoop]: === Iteration 1047 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:13,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:13,810 INFO L82 PathProgramCache]: Analyzing trace with hash 110838591, now seen corresponding path program 1040 times [2020-02-10 20:22:13,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:13,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994475184] [2020-02-10 20:22:13,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:13,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:14,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:14,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994475184] [2020-02-10 20:22:14,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:14,211 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:14,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882904958] [2020-02-10 20:22:14,211 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:14,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:14,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:14,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:14,212 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:22:14,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,360 INFO L93 Difference]: Finished difference Result 1179 states and 4183 transitions. [2020-02-10 20:22:14,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:14,360 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:14,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,363 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:22:14,363 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:22:14,363 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:22:14,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:22:14,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:14,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:22:14,384 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:14,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:14,384 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:22:14,384 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:14,384 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:22:14,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:14,385 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:14,385 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:14,385 INFO L427 AbstractCegarLoop]: === Iteration 1048 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:14,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:14,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1755714407, now seen corresponding path program 1041 times [2020-02-10 20:22:14,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:14,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827273866] [2020-02-10 20:22:14,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:14,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:14,762 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827273866] [2020-02-10 20:22:14,762 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:14,762 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:14,762 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169411925] [2020-02-10 20:22:14,762 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:14,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:14,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:14,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:14,762 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:14,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:14,952 INFO L93 Difference]: Finished difference Result 1178 states and 4181 transitions. [2020-02-10 20:22:14,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:14,952 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:14,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:14,955 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:22:14,955 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:22:14,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:14,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:22:14,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:22:14,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:22:14,977 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:14,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:14,977 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:22:14,977 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:14,977 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:22:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:14,978 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:14,978 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:14,978 INFO L427 AbstractCegarLoop]: === Iteration 1049 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:14,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:14,978 INFO L82 PathProgramCache]: Analyzing trace with hash -732947273, now seen corresponding path program 1042 times [2020-02-10 20:22:14,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:14,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486049737] [2020-02-10 20:22:14,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486049737] [2020-02-10 20:22:15,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:15,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760181697] [2020-02-10 20:22:15,378 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:15,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:15,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:15,379 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:15,514 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:22:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:15,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:15,517 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:22:15,518 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:22:15,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:22:15,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 20:22:15,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:15,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:15,540 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:15,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:15,540 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:15,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:15,540 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:15,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:15,541 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:15,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, 1, 1, 1] [2020-02-10 20:22:15,541 INFO L427 AbstractCegarLoop]: === Iteration 1050 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:15,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:15,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1751848673, now seen corresponding path program 1043 times [2020-02-10 20:22:15,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:15,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624095602] [2020-02-10 20:22:15,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:15,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:15,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:15,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624095602] [2020-02-10 20:22:15,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:15,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:15,931 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898746748] [2020-02-10 20:22:15,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:15,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:15,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:15,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:15,932 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:16,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,079 INFO L93 Difference]: Finished difference Result 1176 states and 4175 transitions. [2020-02-10 20:22:16,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:16,080 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:16,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,083 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:22:16,083 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:22:16,084 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:16,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:22:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 777. [2020-02-10 20:22:16,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:16,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:16,104 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:16,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,105 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:16,105 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:16,105 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:16,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:16,106 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,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, 1, 1, 1] [2020-02-10 20:22:16,106 INFO L427 AbstractCegarLoop]: === Iteration 1051 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,106 INFO L82 PathProgramCache]: Analyzing trace with hash -394322087, now seen corresponding path program 1044 times [2020-02-10 20:22:16,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604987223] [2020-02-10 20:22:16,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:16,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:16,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604987223] [2020-02-10 20:22:16,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:16,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:16,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989143791] [2020-02-10 20:22:16,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:16,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:16,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:16,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:16,502 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:16,634 INFO L93 Difference]: Finished difference Result 1175 states and 4171 transitions. [2020-02-10 20:22:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:16,635 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:16,638 INFO L225 Difference]: With dead ends: 1175 [2020-02-10 20:22:16,638 INFO L226 Difference]: Without dead ends: 1160 [2020-02-10 20:22:16,638 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2020-02-10 20:22:16,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 773. [2020-02-10 20:22:16,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:16,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:22:16,661 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:22:16,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:16,661 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:22:16,661 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:16,661 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:22:16,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:16,662 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:16,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, 1, 1, 1] [2020-02-10 20:22:16,662 INFO L427 AbstractCegarLoop]: === Iteration 1052 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:16,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:16,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2137180577, now seen corresponding path program 1045 times [2020-02-10 20:22:16,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:16,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447168739] [2020-02-10 20:22:16,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:16,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447168739] [2020-02-10 20:22:17,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:17,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356087429] [2020-02-10 20:22:17,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:17,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:17,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:17,054 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:22:17,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:17,190 INFO L93 Difference]: Finished difference Result 1186 states and 4200 transitions. [2020-02-10 20:22:17,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:17,191 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:17,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:17,194 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:17,194 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:22:17,194 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:17,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:22:17,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 779. [2020-02-10 20:22:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:17,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:22:17,215 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:22:17,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:17,216 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:22:17,216 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:17,216 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:22:17,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:17,217 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:17,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, 1, 1, 1] [2020-02-10 20:22:17,217 INFO L427 AbstractCegarLoop]: === Iteration 1053 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:17,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:17,217 INFO L82 PathProgramCache]: Analyzing trace with hash -1156025793, now seen corresponding path program 1046 times [2020-02-10 20:22:17,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:17,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496050811] [2020-02-10 20:22:17,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:17,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:17,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496050811] [2020-02-10 20:22:17,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:17,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:17,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648734813] [2020-02-10 20:22:17,599 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:17,599 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:17,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:17,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:17,599 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:22:17,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:17,726 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 20:22:17,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:17,727 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:17,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:17,730 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:17,730 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:17,730 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:17,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:22:17,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:17,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:17,751 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:17,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:17,752 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:17,752 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:17,752 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:17,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:17,753 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:17,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, 1, 1, 1] [2020-02-10 20:22:17,753 INFO L427 AbstractCegarLoop]: === Iteration 1054 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:17,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:17,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1694281437, now seen corresponding path program 1047 times [2020-02-10 20:22:17,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:17,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255104231] [2020-02-10 20:22:17,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:17,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:18,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255104231] [2020-02-10 20:22:18,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:18,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:18,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472048945] [2020-02-10 20:22:18,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:18,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:18,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:18,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:18,133 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:18,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,268 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:22:18,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:18,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:18,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,271 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:22:18,271 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:22:18,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:18,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:22:18,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:22:18,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:18,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:18,292 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,292 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:18,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:18,292 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:18,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:18,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,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, 1, 1, 1] [2020-02-10 20:22:18,293 INFO L427 AbstractCegarLoop]: === Iteration 1055 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1577918725, now seen corresponding path program 1048 times [2020-02-10 20:22:18,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903735876] [2020-02-10 20:22:18,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:18,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:18,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903735876] [2020-02-10 20:22:18,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:18,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:18,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060176922] [2020-02-10 20:22:18,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:18,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:18,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:18,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:18,673 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:18,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:18,834 INFO L93 Difference]: Finished difference Result 1179 states and 4180 transitions. [2020-02-10 20:22:18,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:18,835 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:18,838 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:22:18,838 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:22:18,838 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:18,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:22:18,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:22:18,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:18,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:22:18,859 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:22:18,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:18,860 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:22:18,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:18,860 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:22:18,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:18,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:18,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, 1, 1, 1] [2020-02-10 20:22:18,861 INFO L427 AbstractCegarLoop]: === Iteration 1056 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:18,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 484984289, now seen corresponding path program 1049 times [2020-02-10 20:22:18,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:18,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269058038] [2020-02-10 20:22:18,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:18,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:19,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269058038] [2020-02-10 20:22:19,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:19,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871040363] [2020-02-10 20:22:19,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:19,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:19,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:19,238 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:22:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:19,365 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:22:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:19,366 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:19,369 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:22:19,369 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:19,369 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:19,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:22:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:19,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:22:19,390 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:19,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:19,390 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:22:19,390 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:19,390 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:22:19,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:19,391 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:19,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, 1, 1, 1] [2020-02-10 20:22:19,392 INFO L427 AbstractCegarLoop]: === Iteration 1057 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:19,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:19,392 INFO L82 PathProgramCache]: Analyzing trace with hash -588101091, now seen corresponding path program 1050 times [2020-02-10 20:22:19,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:19,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568969825] [2020-02-10 20:22:19,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:19,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:19,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 20:22:19,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568969825] [2020-02-10 20:22:19,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:19,781 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:19,781 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539912700] [2020-02-10 20:22:19,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:19,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:19,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:19,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:19,781 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:19,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:19,930 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:22:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:19,931 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:19,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:19,934 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:22:19,934 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:22:19,934 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:19,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:22:19,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:22:19,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:19,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:22:19,955 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:22:19,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:19,955 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:22:19,955 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:19,956 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:22:19,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:19,956 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:19,957 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:19,957 INFO L427 AbstractCegarLoop]: === Iteration 1058 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:19,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:19,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1277332667, now seen corresponding path program 1051 times [2020-02-10 20:22:19,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:19,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66669325] [2020-02-10 20:22:19,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:19,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:20,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:20,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66669325] [2020-02-10 20:22:20,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:20,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:20,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395443440] [2020-02-10 20:22:20,330 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:20,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:20,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:20,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:20,330 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:22:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:20,464 INFO L93 Difference]: Finished difference Result 1181 states and 4186 transitions. [2020-02-10 20:22:20,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:20,464 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:20,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:20,467 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:22:20,467 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:20,468 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:20,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 778. [2020-02-10 20:22:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:22:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:22:20,489 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:20,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:20,489 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:22:20,489 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:22:20,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:20,490 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:20,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, 1, 1, 1] [2020-02-10 20:22:20,490 INFO L427 AbstractCegarLoop]: === Iteration 1059 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:20,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:20,490 INFO L82 PathProgramCache]: Analyzing trace with hash 204247287, now seen corresponding path program 1052 times [2020-02-10 20:22:20,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:20,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396459227] [2020-02-10 20:22:20,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:20,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:20,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:20,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396459227] [2020-02-10 20:22:20,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:20,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:20,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675222177] [2020-02-10 20:22:20,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:20,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:20,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:20,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:20,870 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:21,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,018 INFO L93 Difference]: Finished difference Result 1183 states and 4187 transitions. [2020-02-10 20:22:21,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:21,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:21,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,022 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:22:21,022 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:22:21,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:21,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:22:21,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:22:21,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:21,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:22:21,044 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:22:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,044 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:22:21,044 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:22:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:21,045 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,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, 1, 1, 1] [2020-02-10 20:22:21,045 INFO L427 AbstractCegarLoop]: === Iteration 1060 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash -1923543041, now seen corresponding path program 1053 times [2020-02-10 20:22:21,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165823088] [2020-02-10 20:22:21,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:21,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 20:22:21,430 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165823088] [2020-02-10 20:22:21,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:21,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:21,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006858035] [2020-02-10 20:22:21,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:21,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:21,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:21,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:21,431 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:22:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:21,563 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:22:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:21,563 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:21,566 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:22:21,567 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:22:21,567 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:21,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:22:21,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:22:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:21,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:22:21,588 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:21,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:21,588 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:22:21,588 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:21,588 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:22:21,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:21,589 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:21,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, 1, 1, 1] [2020-02-10 20:22:21,589 INFO L427 AbstractCegarLoop]: === Iteration 1061 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:21,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:21,589 INFO L82 PathProgramCache]: Analyzing trace with hash 225253495, now seen corresponding path program 1054 times [2020-02-10 20:22:21,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:21,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102715167] [2020-02-10 20:22:21,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:22,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102715167] [2020-02-10 20:22:22,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:22,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108797749] [2020-02-10 20:22:22,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:22,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:22,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:22,013 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:22,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,164 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 20:22:22,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:22,165 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:22,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,168 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:22:22,168 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:22:22,168 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:22,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:22:22,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 775. [2020-02-10 20:22:22,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:22,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:22:22,190 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:22:22,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,190 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:22:22,190 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:22,190 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:22:22,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:22,191 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,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, 1, 1, 1] [2020-02-10 20:22:22,191 INFO L427 AbstractCegarLoop]: === Iteration 1062 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1902536833, now seen corresponding path program 1055 times [2020-02-10 20:22:22,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340882103] [2020-02-10 20:22:22,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:22,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 20:22:22,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340882103] [2020-02-10 20:22:22,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:22,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:22,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702202739] [2020-02-10 20:22:22,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:22,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:22,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:22,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:22,583 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:22:22,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:22,722 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 20:22:22,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:22,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:22,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:22,726 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:22:22,726 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:22:22,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:22,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:22:22,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:22:22,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:22,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:22:22,747 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:22:22,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:22,747 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:22:22,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:22,747 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:22:22,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:22,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:22,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, 1, 1, 1] [2020-02-10 20:22:22,749 INFO L427 AbstractCegarLoop]: === Iteration 1063 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:22,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:22,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1319345083, now seen corresponding path program 1056 times [2020-02-10 20:22:22,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:22,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995041514] [2020-02-10 20:22:22,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:22,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995041514] [2020-02-10 20:22:23,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:23,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381722588] [2020-02-10 20:22:23,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:23,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:23,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:23,132 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:22:23,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:23,268 INFO L93 Difference]: Finished difference Result 1178 states and 4173 transitions. [2020-02-10 20:22:23,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:23,268 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:23,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:23,271 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:22:23,271 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:22:23,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:23,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:22:23,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 771. [2020-02-10 20:22:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:22:23,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:22:23,292 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:22:23,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:23,292 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:22:23,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:23,292 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:22:23,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:23,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:23,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, 1, 1, 1] [2020-02-10 20:22:23,293 INFO L427 AbstractCegarLoop]: === Iteration 1064 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:23,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:23,293 INFO L82 PathProgramCache]: Analyzing trace with hash -1231567229, now seen corresponding path program 1057 times [2020-02-10 20:22:23,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:23,293 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219221428] [2020-02-10 20:22:23,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:23,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:23,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:23,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219221428] [2020-02-10 20:22:23,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:23,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:23,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354269897] [2020-02-10 20:22:23,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:23,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:23,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:23,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:23,671 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:22:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:23,808 INFO L93 Difference]: Finished difference Result 1197 states and 4229 transitions. [2020-02-10 20:22:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:23,808 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:23,811 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:22:23,812 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:22:23,812 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:22:23,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:22:23,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:23,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:22:23,832 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:22:23,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:23,833 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:22:23,833 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:23,833 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:22:23,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:23,834 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:23,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, 1, 1, 1] [2020-02-10 20:22:23,834 INFO L427 AbstractCegarLoop]: === Iteration 1065 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:23,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:23,834 INFO L82 PathProgramCache]: Analyzing trace with hash 379373729, now seen corresponding path program 1058 times [2020-02-10 20:22:23,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:23,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104316797] [2020-02-10 20:22:23,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:24,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104316797] [2020-02-10 20:22:24,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:24,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650067265] [2020-02-10 20:22:24,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:24,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:24,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:24,215 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:22:24,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,344 INFO L93 Difference]: Finished difference Result 1194 states and 4220 transitions. [2020-02-10 20:22:24,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:24,345 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:24,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,348 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:22:24,348 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:22:24,348 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:24,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:22:24,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 776. [2020-02-10 20:22:24,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:22:24,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 20:22:24,369 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:24,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,370 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 20:22:24,370 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:24,370 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 20:22:24,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:24,371 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,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, 1, 1, 1] [2020-02-10 20:22:24,371 INFO L427 AbstractCegarLoop]: === Iteration 1066 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,371 INFO L82 PathProgramCache]: Analyzing trace with hash -137475641, now seen corresponding path program 1059 times [2020-02-10 20:22:24,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837463051] [2020-02-10 20:22:24,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:24,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 20:22:24,756 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837463051] [2020-02-10 20:22:24,756 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:24,756 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:24,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081773214] [2020-02-10 20:22:24,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:24,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:24,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:24,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:24,757 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:24,885 INFO L93 Difference]: Finished difference Result 1201 states and 4236 transitions. [2020-02-10 20:22:24,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:24,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:24,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:24,889 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:22:24,889 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:22:24,889 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:22:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 781. [2020-02-10 20:22:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:22:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3103 transitions. [2020-02-10 20:22:24,911 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3103 transitions. Word has length 25 [2020-02-10 20:22:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:24,911 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3103 transitions. [2020-02-10 20:22:24,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:24,911 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3103 transitions. [2020-02-10 20:22:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:24,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:24,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, 1, 1, 1] [2020-02-10 20:22:24,912 INFO L427 AbstractCegarLoop]: === Iteration 1067 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:24,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:24,912 INFO L82 PathProgramCache]: Analyzing trace with hash 400379937, now seen corresponding path program 1060 times [2020-02-10 20:22:24,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:24,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730172557] [2020-02-10 20:22:24,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730172557] [2020-02-10 20:22:25,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:25,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938648855] [2020-02-10 20:22:25,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:25,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:25,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:25,290 INFO L87 Difference]: Start difference. First operand 781 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:22:25,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,420 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:22:25,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:25,421 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:25,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,424 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:22:25,424 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:22:25,424 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:25,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:22:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 20:22:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:22:25,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 20:22:25,445 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:25,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,445 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 20:22:25,445 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:25,446 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 20:22:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:25,446 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,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, 1, 1, 1] [2020-02-10 20:22:25,447 INFO L427 AbstractCegarLoop]: === Iteration 1068 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -126972537, now seen corresponding path program 1061 times [2020-02-10 20:22:25,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227423975] [2020-02-10 20:22:25,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:25,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:25,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227423975] [2020-02-10 20:22:25,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:25,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:25,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959560753] [2020-02-10 20:22:25,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:25,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:25,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:25,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:25,820 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:25,956 INFO L93 Difference]: Finished difference Result 1193 states and 4215 transitions. [2020-02-10 20:22:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:25,956 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:25,959 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:22:25,959 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:22:25,959 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:22:25,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 779. [2020-02-10 20:22:25,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:25,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:22:25,980 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:22:25,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:25,980 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:22:25,980 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:25,980 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:22:25,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:25,981 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:25,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, 1, 1, 1] [2020-02-10 20:22:25,981 INFO L427 AbstractCegarLoop]: === Iteration 1069 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:25,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:25,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1200057917, now seen corresponding path program 1062 times [2020-02-10 20:22:25,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:25,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373867252] [2020-02-10 20:22:25,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373867252] [2020-02-10 20:22:26,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:26,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590828497] [2020-02-10 20:22:26,355 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:26,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:26,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:26,355 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:22:26,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:26,485 INFO L93 Difference]: Finished difference Result 1195 states and 4216 transitions. [2020-02-10 20:22:26,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:26,485 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:26,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:26,488 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:22:26,488 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:22:26,489 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:26,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:22:26,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 773. [2020-02-10 20:22:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:22:26,510 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:22:26,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:26,510 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:22:26,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:26,510 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:22:26,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:26,511 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:26,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, 1, 1, 1] [2020-02-10 20:22:26,511 INFO L427 AbstractCegarLoop]: === Iteration 1070 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:26,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:26,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1674466369, now seen corresponding path program 1063 times [2020-02-10 20:22:26,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:26,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672632520] [2020-02-10 20:22:26,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:26,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:26,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672632520] [2020-02-10 20:22:26,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:26,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:26,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352811400] [2020-02-10 20:22:26,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:26,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:26,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:26,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:26,893 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:22:27,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,019 INFO L93 Difference]: Finished difference Result 1189 states and 4205 transitions. [2020-02-10 20:22:27,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:27,019 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,022 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:22:27,022 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:22:27,022 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:22:27,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 20:22:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:22:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:22:27,043 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:22:27,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,043 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:22:27,043 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:27,043 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:22:27,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:27,044 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,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, 1, 1, 1] [2020-02-10 20:22:27,044 INFO L427 AbstractCegarLoop]: === Iteration 1071 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,045 INFO L82 PathProgramCache]: Analyzing trace with hash -63525411, now seen corresponding path program 1064 times [2020-02-10 20:22:27,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753187883] [2020-02-10 20:22:27,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:27,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:27,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753187883] [2020-02-10 20:22:27,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:27,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:27,435 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559104408] [2020-02-10 20:22:27,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:27,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:27,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:27,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:27,435 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:22:27,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:27,575 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:22:27,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:27,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:27,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:27,579 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:27,579 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:22:27,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:27,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:22:27,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:22:27,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:27,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:27,600 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:27,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:27,600 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:27,600 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:27,600 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:27,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:27,601 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:27,601 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:27,601 INFO L427 AbstractCegarLoop]: === Iteration 1072 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:27,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:27,602 INFO L82 PathProgramCache]: Analyzing trace with hash 513716807, now seen corresponding path program 1065 times [2020-02-10 20:22:27,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:27,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088595093] [2020-02-10 20:22:27,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:27,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 20:22:27,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088595093] [2020-02-10 20:22:27,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:27,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:27,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474415649] [2020-02-10 20:22:27,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:27,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:27,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:27,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:27,980 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:28,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:28,120 INFO L93 Difference]: Finished difference Result 1187 states and 4198 transitions. [2020-02-10 20:22:28,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:28,120 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:28,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:28,124 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:28,124 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:22:28,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:28,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:22:28,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:22:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:28,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:28,144 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:28,145 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:28,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:28,145 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:28,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:28,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:28,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, 1, 1, 1] [2020-02-10 20:22:28,146 INFO L427 AbstractCegarLoop]: === Iteration 1073 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:28,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:28,146 INFO L82 PathProgramCache]: Analyzing trace with hash -21512995, now seen corresponding path program 1066 times [2020-02-10 20:22:28,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:28,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125457294] [2020-02-10 20:22:28,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:28,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:28,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:28,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125457294] [2020-02-10 20:22:28,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:28,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:28,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342056525] [2020-02-10 20:22:28,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:28,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:28,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:28,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:28,516 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:28,676 INFO L93 Difference]: Finished difference Result 1183 states and 4188 transitions. [2020-02-10 20:22:28,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:28,676 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:28,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:28,679 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:22:28,679 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:22:28,680 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:22:28,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:22:28,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:28,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:22:28,700 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:22:28,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:28,700 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:22:28,700 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:28,700 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:22:28,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:28,701 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:28,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, 1, 1, 1] [2020-02-10 20:22:28,702 INFO L427 AbstractCegarLoop]: === Iteration 1074 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:28,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:28,702 INFO L82 PathProgramCache]: Analyzing trace with hash 524219911, now seen corresponding path program 1067 times [2020-02-10 20:22:28,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:28,702 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989451694] [2020-02-10 20:22:28,702 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:28,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:29,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:29,096 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989451694] [2020-02-10 20:22:29,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:29,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:29,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659333524] [2020-02-10 20:22:29,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:29,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:29,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:29,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:29,097 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:22:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,228 INFO L93 Difference]: Finished difference Result 1181 states and 4184 transitions. [2020-02-10 20:22:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:29,229 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:29,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,232 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:22:29,232 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:29,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:29,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:22:29,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:29,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:22:29,254 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:29,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,254 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:22:29,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:29,254 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:22:29,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:29,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,255 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:29,255 INFO L427 AbstractCegarLoop]: === Iteration 1075 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1621950849, now seen corresponding path program 1068 times [2020-02-10 20:22:29,255 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365381113] [2020-02-10 20:22:29,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:29,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:29,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365381113] [2020-02-10 20:22:29,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:29,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:29,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386924774] [2020-02-10 20:22:29,636 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:29,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:29,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:29,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:29,636 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:29,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:29,781 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:22:29,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:29,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:29,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:29,785 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:22:29,785 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:22:29,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:29,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:22:29,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 773. [2020-02-10 20:22:29,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:29,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:22:29,807 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:22:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:29,807 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:22:29,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:22:29,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:29,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:29,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, 1, 1, 1] [2020-02-10 20:22:29,809 INFO L427 AbstractCegarLoop]: === Iteration 1076 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1023273921, now seen corresponding path program 1069 times [2020-02-10 20:22:29,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:29,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027942655] [2020-02-10 20:22:29,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027942655] [2020-02-10 20:22:30,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:30,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460375271] [2020-02-10 20:22:30,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:30,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:30,191 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:22:30,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,325 INFO L93 Difference]: Finished difference Result 1197 states and 4223 transitions. [2020-02-10 20:22:30,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:30,325 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:30,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,328 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:22:30,328 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:22:30,329 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:30,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:22:30,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 780. [2020-02-10 20:22:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:22:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 20:22:30,350 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 20:22:30,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,350 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 20:22:30,350 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:30,350 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 20:22:30,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:30,351 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,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, 1, 1, 1] [2020-02-10 20:22:30,351 INFO L427 AbstractCegarLoop]: === Iteration 1077 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,352 INFO L82 PathProgramCache]: Analyzing trace with hash -485418343, now seen corresponding path program 1070 times [2020-02-10 20:22:30,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318613458] [2020-02-10 20:22:30,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:30,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:30,730 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318613458] [2020-02-10 20:22:30,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:30,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:30,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178975901] [2020-02-10 20:22:30,730 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:30,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:30,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:30,731 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:22:30,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:30,866 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 20:22:30,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:30,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:30,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:30,870 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:22:30,870 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:22:30,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:22:30,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:22:30,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:22:30,891 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:22:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:30,891 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:22:30,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:30,891 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:22:30,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:30,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:30,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:30,892 INFO L427 AbstractCegarLoop]: === Iteration 1078 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:30,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:30,893 INFO L82 PathProgramCache]: Analyzing trace with hash 70817667, now seen corresponding path program 1071 times [2020-02-10 20:22:30,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:30,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262677968] [2020-02-10 20:22:30,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:30,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262677968] [2020-02-10 20:22:31,267 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:31,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797557821] [2020-02-10 20:22:31,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:31,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:31,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:31,267 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:22:31,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,398 INFO L93 Difference]: Finished difference Result 1191 states and 4206 transitions. [2020-02-10 20:22:31,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:31,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:31,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,401 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:22:31,401 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:22:31,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:31,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:22:31,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:22:31,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:31,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:22:31,422 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:31,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,422 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:22:31,422 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:22:31,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:31,423 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,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, 1, 1, 1] [2020-02-10 20:22:31,424 INFO L427 AbstractCegarLoop]: === Iteration 1079 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,424 INFO L82 PathProgramCache]: Analyzing trace with hash -464412135, now seen corresponding path program 1072 times [2020-02-10 20:22:31,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672329796] [2020-02-10 20:22:31,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:31,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672329796] [2020-02-10 20:22:31,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546698534] [2020-02-10 20:22:31,798 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:31,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:31,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:31,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:31,798 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:31,957 INFO L93 Difference]: Finished difference Result 1187 states and 4196 transitions. [2020-02-10 20:22:31,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:31,958 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:31,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:31,961 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:22:31,961 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:22:31,961 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:31,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:22:31,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 775. [2020-02-10 20:22:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:31,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:22:31,982 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:22:31,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:31,982 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:22:31,982 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:31,983 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:22:31,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:31,983 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:31,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, 1, 1, 1] [2020-02-10 20:22:31,984 INFO L427 AbstractCegarLoop]: === Iteration 1080 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:31,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 102326979, now seen corresponding path program 1073 times [2020-02-10 20:22:31,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:31,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377559329] [2020-02-10 20:22:31,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:31,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377559329] [2020-02-10 20:22:32,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:32,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002413197] [2020-02-10 20:22:32,357 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:32,357 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:32,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:32,358 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:22:32,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:32,501 INFO L93 Difference]: Finished difference Result 1189 states and 4200 transitions. [2020-02-10 20:22:32,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:32,501 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:32,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:32,504 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:22:32,505 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:22:32,505 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:32,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:22:32,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 777. [2020-02-10 20:22:32,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:32,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:22:32,527 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:22:32,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:32,527 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:22:32,527 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:32,527 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:22:32,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:32,528 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:32,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, 1, 1, 1] [2020-02-10 20:22:32,529 INFO L427 AbstractCegarLoop]: === Iteration 1081 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:32,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:32,529 INFO L82 PathProgramCache]: Analyzing trace with hash -970758401, now seen corresponding path program 1074 times [2020-02-10 20:22:32,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:32,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640222546] [2020-02-10 20:22:32,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:32,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:32,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640222546] [2020-02-10 20:22:32,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:32,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:32,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427899498] [2020-02-10 20:22:32,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:32,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:32,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:32,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:32,905 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:22:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,068 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 20:22:33,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:33,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,071 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:33,072 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:22:33,072 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:33,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:22:33,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 773. [2020-02-10 20:22:33,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:33,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:22:33,092 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:22:33,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,093 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:22:33,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:33,093 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:22:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:33,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,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, 1, 1, 1] [2020-02-10 20:22:33,094 INFO L427 AbstractCegarLoop]: === Iteration 1082 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,094 INFO L82 PathProgramCache]: Analyzing trace with hash 913263261, now seen corresponding path program 1075 times [2020-02-10 20:22:33,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,094 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728912738] [2020-02-10 20:22:33,094 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:33,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:33,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728912738] [2020-02-10 20:22:33,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:33,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:33,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550600821] [2020-02-10 20:22:33,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:33,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:33,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:33,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:33,472 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:22:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:33,605 INFO L93 Difference]: Finished difference Result 1184 states and 4191 transitions. [2020-02-10 20:22:33,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:33,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:33,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:33,608 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:22:33,608 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:22:33,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:33,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:22:33,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 778. [2020-02-10 20:22:33,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:22:33,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:22:33,630 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:33,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:33,630 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:22:33,630 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:33,630 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:22:33,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:33,631 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:33,631 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:33,631 INFO L427 AbstractCegarLoop]: === Iteration 1083 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:33,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:33,631 INFO L82 PathProgramCache]: Analyzing trace with hash -159822119, now seen corresponding path program 1076 times [2020-02-10 20:22:33,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:33,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078055649] [2020-02-10 20:22:33,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:33,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078055649] [2020-02-10 20:22:34,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:34,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761949828] [2020-02-10 20:22:34,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:34,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:34,031 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:34,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:34,163 INFO L93 Difference]: Finished difference Result 1186 states and 4192 transitions. [2020-02-10 20:22:34,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:34,164 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:34,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:34,167 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:22:34,167 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:22:34,167 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:22:34,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 775. [2020-02-10 20:22:34,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:34,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:22:34,188 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:22:34,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:34,189 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:22:34,189 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:34,189 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:22:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:34,190 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:34,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, 1, 1, 1] [2020-02-10 20:22:34,190 INFO L427 AbstractCegarLoop]: === Iteration 1084 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:34,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:34,190 INFO L82 PathProgramCache]: Analyzing trace with hash 2007354849, now seen corresponding path program 1077 times [2020-02-10 20:22:34,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:34,190 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639312550] [2020-02-10 20:22:34,190 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:34,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:34,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639312550] [2020-02-10 20:22:34,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:34,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:34,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416847953] [2020-02-10 20:22:34,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:34,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:34,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:34,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:34,577 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:22:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:34,712 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:22:34,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:34,713 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:34,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:34,716 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:22:34,716 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:22:34,716 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:34,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:22:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:22:34,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:22:34,737 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:22:34,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:34,737 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:22:34,737 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:22:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:34,738 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:34,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, 1, 1, 1] [2020-02-10 20:22:34,738 INFO L427 AbstractCegarLoop]: === Iteration 1085 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash -138815911, now seen corresponding path program 1078 times [2020-02-10 20:22:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456433449] [2020-02-10 20:22:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:34,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:35,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 20:22:35,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456433449] [2020-02-10 20:22:35,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:35,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:35,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655812487] [2020-02-10 20:22:35,126 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:35,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:35,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:35,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:35,127 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:22:35,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,284 INFO L93 Difference]: Finished difference Result 1179 states and 4176 transitions. [2020-02-10 20:22:35,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:35,285 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:35,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,288 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:22:35,288 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:22:35,288 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:35,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:22:35,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:22:35,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:35,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:22:35,310 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:22:35,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,310 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:22:35,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:35,310 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:22:35,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:35,311 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:35,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, 1, 1, 1] [2020-02-10 20:22:35,311 INFO L427 AbstractCegarLoop]: === Iteration 1086 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,311 INFO L82 PathProgramCache]: Analyzing trace with hash 2028361057, now seen corresponding path program 1079 times [2020-02-10 20:22:35,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191329246] [2020-02-10 20:22:35,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:35,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:35,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191329246] [2020-02-10 20:22:35,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:35,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:35,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265045702] [2020-02-10 20:22:35,695 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:35,695 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:35,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:35,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:35,695 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:22:35,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:35,835 INFO L93 Difference]: Finished difference Result 1184 states and 4186 transitions. [2020-02-10 20:22:35,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:35,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:35,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:35,839 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:22:35,839 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:22:35,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:35,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:22:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:22:35,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:22:35,860 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:22:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:35,860 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:22:35,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:35,860 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:22:35,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:35,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:35,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, 1, 1, 1] [2020-02-10 20:22:35,861 INFO L427 AbstractCegarLoop]: === Iteration 1087 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:35,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:35,861 INFO L82 PathProgramCache]: Analyzing trace with hash 955275677, now seen corresponding path program 1080 times [2020-02-10 20:22:35,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:35,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171533977] [2020-02-10 20:22:35,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:35,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171533977] [2020-02-10 20:22:36,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002057408] [2020-02-10 20:22:36,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:36,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:36,247 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:22:36,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,405 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 20:22:36,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:36,406 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:36,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,409 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:22:36,409 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 20:22:36,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:36,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 20:22:36,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 769. [2020-02-10 20:22:36,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:22:36,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3072 transitions. [2020-02-10 20:22:36,430 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3072 transitions. Word has length 25 [2020-02-10 20:22:36,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,431 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3072 transitions. [2020-02-10 20:22:36,431 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:36,431 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3072 transitions. [2020-02-10 20:22:36,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:36,432 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,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, 1, 1, 1] [2020-02-10 20:22:36,432 INFO L427 AbstractCegarLoop]: === Iteration 1088 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1755725605, now seen corresponding path program 1081 times [2020-02-10 20:22:36,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81930058] [2020-02-10 20:22:36,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:36,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:36,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81930058] [2020-02-10 20:22:36,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:36,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:36,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699129648] [2020-02-10 20:22:36,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:36,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:36,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:36,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:36,809 INFO L87 Difference]: Start difference. First operand 769 states and 3072 transitions. Second operand 10 states. [2020-02-10 20:22:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:36,950 INFO L93 Difference]: Finished difference Result 1246 states and 4389 transitions. [2020-02-10 20:22:36,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:36,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:36,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:36,953 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:22:36,953 INFO L226 Difference]: Without dead ends: 1233 [2020-02-10 20:22:36,954 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:36,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2020-02-10 20:22:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 783. [2020-02-10 20:22:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3124 transitions. [2020-02-10 20:22:36,975 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3124 transitions. Word has length 25 [2020-02-10 20:22:36,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:36,975 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3124 transitions. [2020-02-10 20:22:36,975 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:36,975 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3124 transitions. [2020-02-10 20:22:36,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:36,976 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:36,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, 1, 1, 1] [2020-02-10 20:22:36,976 INFO L427 AbstractCegarLoop]: === Iteration 1089 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:36,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:36,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1568990077, now seen corresponding path program 1082 times [2020-02-10 20:22:36,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:36,976 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805819740] [2020-02-10 20:22:36,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:36,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805819740] [2020-02-10 20:22:37,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:37,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833534739] [2020-02-10 20:22:37,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:37,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:37,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:37,343 INFO L87 Difference]: Start difference. First operand 783 states and 3124 transitions. Second operand 10 states. [2020-02-10 20:22:37,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:37,478 INFO L93 Difference]: Finished difference Result 1248 states and 4389 transitions. [2020-02-10 20:22:37,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:37,478 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:37,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:37,482 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:22:37,482 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:22:37,482 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:22:37,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 779. [2020-02-10 20:22:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:37,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3113 transitions. [2020-02-10 20:22:37,503 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3113 transitions. Word has length 25 [2020-02-10 20:22:37,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:37,503 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3113 transitions. [2020-02-10 20:22:37,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:37,504 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3113 transitions. [2020-02-10 20:22:37,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:37,504 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:37,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, 1, 1, 1] [2020-02-10 20:22:37,505 INFO L427 AbstractCegarLoop]: === Iteration 1090 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:37,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:37,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1312826465, now seen corresponding path program 1083 times [2020-02-10 20:22:37,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:37,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1596712325] [2020-02-10 20:22:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:37,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:37,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1596712325] [2020-02-10 20:22:37,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:37,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:37,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128897876] [2020-02-10 20:22:37,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:37,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:37,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:37,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:37,877 INFO L87 Difference]: Start difference. First operand 779 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:22:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,014 INFO L93 Difference]: Finished difference Result 1247 states and 4387 transitions. [2020-02-10 20:22:38,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:38,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,017 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:22:38,018 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:22:38,018 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:38,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:22:38,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 783. [2020-02-10 20:22:38,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 20:22:38,039 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 20:22:38,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:38,039 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 20:22:38,039 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:38,039 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 20:22:38,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:38,040 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:38,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, 1, 1, 1] [2020-02-10 20:22:38,041 INFO L427 AbstractCegarLoop]: === Iteration 1091 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:38,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:38,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1990883009, now seen corresponding path program 1084 times [2020-02-10 20:22:38,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:38,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810517568] [2020-02-10 20:22:38,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,406 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810517568] [2020-02-10 20:22:38,406 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,406 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:38,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309240645] [2020-02-10 20:22:38,407 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:38,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:38,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:38,407 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:22:38,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:38,583 INFO L93 Difference]: Finished difference Result 1250 states and 4389 transitions. [2020-02-10 20:22:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:38,583 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:38,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:38,586 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:22:38,586 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:22:38,587 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:38,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:22:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 779. [2020-02-10 20:22:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:38,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 20:22:38,607 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 20:22:38,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:38,608 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 20:22:38,608 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:38,608 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 20:22:38,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:38,609 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:38,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, 1, 1, 1] [2020-02-10 20:22:38,609 INFO L427 AbstractCegarLoop]: === Iteration 1092 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:38,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:38,609 INFO L82 PathProgramCache]: Analyzing trace with hash -904768667, now seen corresponding path program 1085 times [2020-02-10 20:22:38,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:38,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885220523] [2020-02-10 20:22:38,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:38,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:38,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:38,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885220523] [2020-02-10 20:22:38,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:38,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:38,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658249029] [2020-02-10 20:22:38,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:38,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:38,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:38,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:38,974 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:22:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:39,112 INFO L93 Difference]: Finished difference Result 1253 states and 4397 transitions. [2020-02-10 20:22:39,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:39,113 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:39,116 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:22:39,116 INFO L226 Difference]: Without dead ends: 1238 [2020-02-10 20:22:39,117 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:39,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1238 states. [2020-02-10 20:22:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1238 to 785. [2020-02-10 20:22:39,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:22:39,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3120 transitions. [2020-02-10 20:22:39,139 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3120 transitions. Word has length 25 [2020-02-10 20:22:39,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,139 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3120 transitions. [2020-02-10 20:22:39,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:39,139 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3120 transitions. [2020-02-10 20:22:39,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:39,140 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,140 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:39,140 INFO L427 AbstractCegarLoop]: === Iteration 1093 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1977854047, now seen corresponding path program 1086 times [2020-02-10 20:22:39,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381546341] [2020-02-10 20:22:39,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:39,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:39,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381546341] [2020-02-10 20:22:39,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:39,517 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:39,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667048997] [2020-02-10 20:22:39,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:39,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:39,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:39,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:39,517 INFO L87 Difference]: Start difference. First operand 785 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:22:39,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:39,656 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 20:22:39,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:39,657 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:39,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:39,660 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:22:39,660 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:22:39,660 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:39,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:22:39,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 775. [2020-02-10 20:22:39,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:39,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3098 transitions. [2020-02-10 20:22:39,681 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3098 transitions. Word has length 25 [2020-02-10 20:22:39,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:39,682 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3098 transitions. [2020-02-10 20:22:39,682 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:39,682 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3098 transitions. [2020-02-10 20:22:39,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:39,683 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:39,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, 1, 1, 1] [2020-02-10 20:22:39,683 INFO L427 AbstractCegarLoop]: === Iteration 1094 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:39,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:39,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1333239879, now seen corresponding path program 1087 times [2020-02-10 20:22:39,683 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:39,683 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979045158] [2020-02-10 20:22:39,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:39,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:40,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:40,056 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979045158] [2020-02-10 20:22:40,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:40,056 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:40,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911928689] [2020-02-10 20:22:40,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:40,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:40,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:40,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:40,057 INFO L87 Difference]: Start difference. First operand 775 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:22:40,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,192 INFO L93 Difference]: Finished difference Result 1243 states and 4378 transitions. [2020-02-10 20:22:40,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:40,193 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:40,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,196 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:22:40,196 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:22:40,197 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:40,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:22:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:22:40,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3120 transitions. [2020-02-10 20:22:40,218 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3120 transitions. Word has length 25 [2020-02-10 20:22:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,218 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3120 transitions. [2020-02-10 20:22:40,218 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3120 transitions. [2020-02-10 20:22:40,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:40,219 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:40,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, 1, 1, 1] [2020-02-10 20:22:40,219 INFO L427 AbstractCegarLoop]: === Iteration 1095 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1991475803, now seen corresponding path program 1088 times [2020-02-10 20:22:40,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428070000] [2020-02-10 20:22:40,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:40,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428070000] [2020-02-10 20:22:40,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:40,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:40,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401322405] [2020-02-10 20:22:40,592 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:40,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:40,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:40,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:40,592 INFO L87 Difference]: Start difference. First operand 783 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:22:40,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:40,729 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 20:22:40,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:40,729 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:40,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:40,732 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:22:40,733 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:22:40,733 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:40,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:22:40,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:22:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:40,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3109 transitions. [2020-02-10 20:22:40,754 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3109 transitions. Word has length 25 [2020-02-10 20:22:40,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:40,754 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3109 transitions. [2020-02-10 20:22:40,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:40,754 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3109 transitions. [2020-02-10 20:22:40,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:40,755 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22: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, 1, 1, 1] [2020-02-10 20:22:40,755 INFO L427 AbstractCegarLoop]: === Iteration 1096 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:40,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:40,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1478592479, now seen corresponding path program 1089 times [2020-02-10 20:22:40,755 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:40,755 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533771424] [2020-02-10 20:22:40,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,143 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533771424] [2020-02-10 20:22:41,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:41,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824912929] [2020-02-10 20:22:41,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:41,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:41,144 INFO L87 Difference]: Start difference. First operand 779 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:22:41,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,276 INFO L93 Difference]: Finished difference Result 1242 states and 4372 transitions. [2020-02-10 20:22:41,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:41,276 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:41,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,280 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:22:41,280 INFO L226 Difference]: Without dead ends: 1229 [2020-02-10 20:22:41,280 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:41,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2020-02-10 20:22:41,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 783. [2020-02-10 20:22:41,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:22:41,301 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:22:41,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,302 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:22:41,302 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:41,302 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:22:41,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:41,303 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,303 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:41,303 INFO L427 AbstractCegarLoop]: === Iteration 1097 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,303 INFO L82 PathProgramCache]: Analyzing trace with hash -476831553, now seen corresponding path program 1090 times [2020-02-10 20:22:41,303 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,303 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263236151] [2020-02-10 20:22:41,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:41,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:41,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263236151] [2020-02-10 20:22:41,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:41,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:41,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251442146] [2020-02-10 20:22:41,680 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:41,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:41,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:41,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:41,681 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:22:41,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:41,836 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 20:22:41,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:41,836 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:41,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:41,839 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:22:41,839 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:22:41,839 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:41,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:22:41,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 779. [2020-02-10 20:22:41,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:41,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:22:41,860 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:22:41,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:41,860 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:22:41,860 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:22:41,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:41,861 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:41,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, 1, 1, 1] [2020-02-10 20:22:41,862 INFO L427 AbstractCegarLoop]: === Iteration 1098 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:41,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:41,862 INFO L82 PathProgramCache]: Analyzing trace with hash -1001658169, now seen corresponding path program 1091 times [2020-02-10 20:22:41,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:41,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053410163] [2020-02-10 20:22:41,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,234 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053410163] [2020-02-10 20:22:42,234 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,235 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:42,235 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74373183] [2020-02-10 20:22:42,235 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:42,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:42,235 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:22:42,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,370 INFO L93 Difference]: Finished difference Result 1247 states and 4379 transitions. [2020-02-10 20:22:42,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:42,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:42,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,374 INFO L225 Difference]: With dead ends: 1247 [2020-02-10 20:22:42,374 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:22:42,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:42,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:22:42,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 784. [2020-02-10 20:22:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:22:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 20:22:42,395 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 20:22:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,395 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 20:22:42,395 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 20:22:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:42,396 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,396 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:42,396 INFO L427 AbstractCegarLoop]: === Iteration 1099 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,397 INFO L82 PathProgramCache]: Analyzing trace with hash -463802591, now seen corresponding path program 1092 times [2020-02-10 20:22:42,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126871440] [2020-02-10 20:22:42,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:42,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:42,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126871440] [2020-02-10 20:22:42,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:42,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:42,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636802593] [2020-02-10 20:22:42,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:42,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:42,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:42,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:42,785 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:22:42,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:42,919 INFO L93 Difference]: Finished difference Result 1246 states and 4372 transitions. [2020-02-10 20:22:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:42,919 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:42,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:42,923 INFO L225 Difference]: With dead ends: 1246 [2020-02-10 20:22:42,923 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:22:42,923 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:22:42,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 775. [2020-02-10 20:22:42,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:42,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3094 transitions. [2020-02-10 20:22:42,944 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:42,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:42,944 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3094 transitions. [2020-02-10 20:22:42,944 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:42,944 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3094 transitions. [2020-02-10 20:22:42,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:42,945 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:42,945 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:42,945 INFO L427 AbstractCegarLoop]: === Iteration 1100 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:42,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:42,945 INFO L82 PathProgramCache]: Analyzing trace with hash 45369287, now seen corresponding path program 1093 times [2020-02-10 20:22:42,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:42,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078494968] [2020-02-10 20:22:42,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:43,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078494968] [2020-02-10 20:22:43,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:43,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505182624] [2020-02-10 20:22:43,310 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:43,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:43,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:43,311 INFO L87 Difference]: Start difference. First operand 775 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:43,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:43,463 INFO L93 Difference]: Finished difference Result 1245 states and 4378 transitions. [2020-02-10 20:22:43,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:43,463 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:43,466 INFO L225 Difference]: With dead ends: 1245 [2020-02-10 20:22:43,467 INFO L226 Difference]: Without dead ends: 1232 [2020-02-10 20:22:43,467 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:43,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2020-02-10 20:22:43,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 783. [2020-02-10 20:22:43,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:43,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3116 transitions. [2020-02-10 20:22:43,488 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3116 transitions. Word has length 25 [2020-02-10 20:22:43,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:43,488 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3116 transitions. [2020-02-10 20:22:43,488 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:43,488 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3116 transitions. [2020-02-10 20:22:43,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:43,489 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:43,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, 1, 1, 1] [2020-02-10 20:22:43,489 INFO L427 AbstractCegarLoop]: === Iteration 1101 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:43,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:43,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1036627109, now seen corresponding path program 1094 times [2020-02-10 20:22:43,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:43,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073362326] [2020-02-10 20:22:43,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:43,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:43,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 20:22:43,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073362326] [2020-02-10 20:22:43,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:43,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:43,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836840387] [2020-02-10 20:22:43,860 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:43,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:43,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:43,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:43,860 INFO L87 Difference]: Start difference. First operand 783 states and 3116 transitions. Second operand 10 states. [2020-02-10 20:22:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:43,998 INFO L93 Difference]: Finished difference Result 1248 states and 4380 transitions. [2020-02-10 20:22:43,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:43,999 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,002 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:22:44,002 INFO L226 Difference]: Without dead ends: 1228 [2020-02-10 20:22:44,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2020-02-10 20:22:44,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 779. [2020-02-10 20:22:44,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:44,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3105 transitions. [2020-02-10 20:22:44,024 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3105 transitions. Word has length 25 [2020-02-10 20:22:44,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,024 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3105 transitions. [2020-02-10 20:22:44,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:44,024 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3105 transitions. [2020-02-10 20:22:44,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:44,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,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, 1, 1, 1] [2020-02-10 20:22:44,025 INFO L427 AbstractCegarLoop]: === Iteration 1102 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,025 INFO L82 PathProgramCache]: Analyzing trace with hash 1971403365, now seen corresponding path program 1095 times [2020-02-10 20:22:44,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727297733] [2020-02-10 20:22:44,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:44,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727297733] [2020-02-10 20:22:44,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:44,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:44,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538454643] [2020-02-10 20:22:44,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:44,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:44,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:44,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:44,401 INFO L87 Difference]: Start difference. First operand 779 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:22:44,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:44,528 INFO L93 Difference]: Finished difference Result 1243 states and 4370 transitions. [2020-02-10 20:22:44,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:44,528 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:44,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:44,531 INFO L225 Difference]: With dead ends: 1243 [2020-02-10 20:22:44,531 INFO L226 Difference]: Without dead ends: 1230 [2020-02-10 20:22:44,531 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:44,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2020-02-10 20:22:44,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 783. [2020-02-10 20:22:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:22:44,552 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:22:44,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:44,552 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:22:44,552 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:44,552 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:22:44,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:44,553 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:44,553 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:44,554 INFO L427 AbstractCegarLoop]: === Iteration 1103 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:44,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:44,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1321803005, now seen corresponding path program 1096 times [2020-02-10 20:22:44,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:44,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895171533] [2020-02-10 20:22:44,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:44,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:44,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:44,932 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895171533] [2020-02-10 20:22:44,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:44,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:44,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76821486] [2020-02-10 20:22:44,932 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:44,933 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:44,933 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:44,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:44,933 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:22:45,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,066 INFO L93 Difference]: Finished difference Result 1244 states and 4368 transitions. [2020-02-10 20:22:45,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:45,067 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:45,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,070 INFO L225 Difference]: With dead ends: 1244 [2020-02-10 20:22:45,070 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:22:45,070 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:45,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:22:45,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 779. [2020-02-10 20:22:45,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:45,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3101 transitions. [2020-02-10 20:22:45,092 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3101 transitions. Word has length 25 [2020-02-10 20:22:45,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,092 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3101 transitions. [2020-02-10 20:22:45,092 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:45,092 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3101 transitions. [2020-02-10 20:22:45,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:45,093 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,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, 1, 1, 1] [2020-02-10 20:22:45,093 INFO L427 AbstractCegarLoop]: === Iteration 1104 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,093 INFO L82 PathProgramCache]: Analyzing trace with hash 2026444743, now seen corresponding path program 1097 times [2020-02-10 20:22:45,093 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,093 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489822287] [2020-02-10 20:22:45,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:45,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:45,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489822287] [2020-02-10 20:22:45,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:45,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:45,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680257318] [2020-02-10 20:22:45,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:45,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:45,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:45,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:45,472 INFO L87 Difference]: Start difference. First operand 779 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:22:45,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:45,617 INFO L93 Difference]: Finished difference Result 1250 states and 4381 transitions. [2020-02-10 20:22:45,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:45,618 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:45,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:45,621 INFO L225 Difference]: With dead ends: 1250 [2020-02-10 20:22:45,621 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:22:45,621 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:45,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:22:45,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 784. [2020-02-10 20:22:45,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:22:45,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3110 transitions. [2020-02-10 20:22:45,642 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3110 transitions. Word has length 25 [2020-02-10 20:22:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:45,642 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3110 transitions. [2020-02-10 20:22:45,642 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3110 transitions. [2020-02-10 20:22:45,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:45,643 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:45,643 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:45,643 INFO L427 AbstractCegarLoop]: === Iteration 1105 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:45,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:45,644 INFO L82 PathProgramCache]: Analyzing trace with hash -657581595, now seen corresponding path program 1098 times [2020-02-10 20:22:45,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:45,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526448085] [2020-02-10 20:22:45,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:45,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,008 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526448085] [2020-02-10 20:22:46,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:46,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053794694] [2020-02-10 20:22:46,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:46,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:46,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:46,009 INFO L87 Difference]: Start difference. First operand 784 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:22:46,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,153 INFO L93 Difference]: Finished difference Result 1248 states and 4372 transitions. [2020-02-10 20:22:46,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:46,153 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:46,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,156 INFO L225 Difference]: With dead ends: 1248 [2020-02-10 20:22:46,157 INFO L226 Difference]: Without dead ends: 1225 [2020-02-10 20:22:46,157 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2020-02-10 20:22:46,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 775. [2020-02-10 20:22:46,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:46,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3090 transitions. [2020-02-10 20:22:46,177 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3090 transitions. Word has length 25 [2020-02-10 20:22:46,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,178 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3090 transitions. [2020-02-10 20:22:46,178 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:46,178 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3090 transitions. [2020-02-10 20:22:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:46,179 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,179 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:46,179 INFO L427 AbstractCegarLoop]: === Iteration 1106 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,179 INFO L82 PathProgramCache]: Analyzing trace with hash -285193085, now seen corresponding path program 1099 times [2020-02-10 20:22:46,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025438381] [2020-02-10 20:22:46,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:46,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:46,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025438381] [2020-02-10 20:22:46,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:46,559 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:46,559 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439005109] [2020-02-10 20:22:46,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:46,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:46,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:46,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:46,560 INFO L87 Difference]: Start difference. First operand 775 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:22:46,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:46,700 INFO L93 Difference]: Finished difference Result 1257 states and 4405 transitions. [2020-02-10 20:22:46,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:46,700 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:46,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:46,703 INFO L225 Difference]: With dead ends: 1257 [2020-02-10 20:22:46,703 INFO L226 Difference]: Without dead ends: 1242 [2020-02-10 20:22:46,703 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2020-02-10 20:22:46,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 786. [2020-02-10 20:22:46,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2020-02-10 20:22:46,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 3120 transitions. [2020-02-10 20:22:46,724 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 3120 transitions. Word has length 25 [2020-02-10 20:22:46,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:46,725 INFO L479 AbstractCegarLoop]: Abstraction has 786 states and 3120 transitions. [2020-02-10 20:22:46,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:46,725 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 3120 transitions. [2020-02-10 20:22:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:46,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:46,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, 1, 1, 1] [2020-02-10 20:22:46,726 INFO L427 AbstractCegarLoop]: === Iteration 1107 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:46,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:46,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1358278465, now seen corresponding path program 1100 times [2020-02-10 20:22:46,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:46,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967671676] [2020-02-10 20:22:46,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:46,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,106 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967671676] [2020-02-10 20:22:47,106 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,106 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:47,106 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826037281] [2020-02-10 20:22:47,107 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:47,107 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:47,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:47,107 INFO L87 Difference]: Start difference. First operand 786 states and 3120 transitions. Second operand 10 states. [2020-02-10 20:22:47,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:47,235 INFO L93 Difference]: Finished difference Result 1258 states and 4401 transitions. [2020-02-10 20:22:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:47,236 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:47,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:47,239 INFO L225 Difference]: With dead ends: 1258 [2020-02-10 20:22:47,239 INFO L226 Difference]: Without dead ends: 1236 [2020-02-10 20:22:47,239 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:47,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2020-02-10 20:22:47,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 780. [2020-02-10 20:22:47,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:22:47,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3104 transitions. [2020-02-10 20:22:47,260 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3104 transitions. Word has length 25 [2020-02-10 20:22:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:47,260 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3104 transitions. [2020-02-10 20:22:47,260 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3104 transitions. [2020-02-10 20:22:47,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:47,261 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:47,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, 1, 1, 1] [2020-02-10 20:22:47,262 INFO L427 AbstractCegarLoop]: === Iteration 1108 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:47,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:47,262 INFO L82 PathProgramCache]: Analyzing trace with hash -1885630939, now seen corresponding path program 1101 times [2020-02-10 20:22:47,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:47,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978439690] [2020-02-10 20:22:47,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:47,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:47,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978439690] [2020-02-10 20:22:47,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:47,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:47,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458627803] [2020-02-10 20:22:47,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:47,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:47,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:47,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:47,642 INFO L87 Difference]: Start difference. First operand 780 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:22:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:47,772 INFO L93 Difference]: Finished difference Result 1254 states and 4393 transitions. [2020-02-10 20:22:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:47,773 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:47,776 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:22:47,776 INFO L226 Difference]: Without dead ends: 1239 [2020-02-10 20:22:47,776 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:47,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2020-02-10 20:22:47,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 785. [2020-02-10 20:22:47,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:22:47,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3113 transitions. [2020-02-10 20:22:47,797 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3113 transitions. Word has length 25 [2020-02-10 20:22:47,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:47,797 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3113 transitions. [2020-02-10 20:22:47,797 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:47,797 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3113 transitions. [2020-02-10 20:22:47,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:47,798 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:47,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, 1, 1, 1] [2020-02-10 20:22:47,798 INFO L427 AbstractCegarLoop]: === Iteration 1109 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:47,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:47,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1347775361, now seen corresponding path program 1102 times [2020-02-10 20:22:47,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:47,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739562784] [2020-02-10 20:22:47,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739562784] [2020-02-10 20:22:48,178 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:48,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370033825] [2020-02-10 20:22:48,179 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:48,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:48,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:48,179 INFO L87 Difference]: Start difference. First operand 785 states and 3113 transitions. Second operand 10 states. [2020-02-10 20:22:48,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,314 INFO L93 Difference]: Finished difference Result 1253 states and 4386 transitions. [2020-02-10 20:22:48,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:48,314 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:48,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,317 INFO L225 Difference]: With dead ends: 1253 [2020-02-10 20:22:48,317 INFO L226 Difference]: Without dead ends: 1234 [2020-02-10 20:22:48,317 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:48,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1234 states. [2020-02-10 20:22:48,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1234 to 780. [2020-02-10 20:22:48,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:22:48,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 20:22:48,338 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 20:22:48,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,338 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 20:22:48,338 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:48,339 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 20:22:48,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:48,339 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,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, 1, 1, 1] [2020-02-10 20:22:48,340 INFO L427 AbstractCegarLoop]: === Iteration 1110 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,340 INFO L82 PathProgramCache]: Analyzing trace with hash -1864624731, now seen corresponding path program 1103 times [2020-02-10 20:22:48,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841458119] [2020-02-10 20:22:48,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:48,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:48,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841458119] [2020-02-10 20:22:48,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:48,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:48,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377208759] [2020-02-10 20:22:48,728 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:48,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:48,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:48,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:48,729 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:22:48,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:48,858 INFO L93 Difference]: Finished difference Result 1256 states and 4392 transitions. [2020-02-10 20:22:48,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:48,859 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:48,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:48,862 INFO L225 Difference]: With dead ends: 1256 [2020-02-10 20:22:48,862 INFO L226 Difference]: Without dead ends: 1240 [2020-02-10 20:22:48,862 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:48,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1240 states. [2020-02-10 20:22:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1240 to 785. [2020-02-10 20:22:48,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2020-02-10 20:22:48,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 3108 transitions. [2020-02-10 20:22:48,884 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 3108 transitions. Word has length 25 [2020-02-10 20:22:48,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:48,884 INFO L479 AbstractCegarLoop]: Abstraction has 785 states and 3108 transitions. [2020-02-10 20:22:48,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:48,884 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 3108 transitions. [2020-02-10 20:22:48,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:48,885 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:48,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, 1, 1, 1] [2020-02-10 20:22:48,885 INFO L427 AbstractCegarLoop]: === Iteration 1111 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:48,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:48,885 INFO L82 PathProgramCache]: Analyzing trace with hash -253683773, now seen corresponding path program 1104 times [2020-02-10 20:22:48,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:48,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529967358] [2020-02-10 20:22:48,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:48,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22: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 20:22:49,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529967358] [2020-02-10 20:22:49,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,261 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:49,261 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105905921] [2020-02-10 20:22:49,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:49,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:49,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:49,262 INFO L87 Difference]: Start difference. First operand 785 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:22:49,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,402 INFO L93 Difference]: Finished difference Result 1254 states and 4383 transitions. [2020-02-10 20:22:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:49,402 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:49,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,406 INFO L225 Difference]: With dead ends: 1254 [2020-02-10 20:22:49,406 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:22:49,406 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:49,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:22:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 771. [2020-02-10 20:22:49,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:22:49,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3081 transitions. [2020-02-10 20:22:49,427 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3081 transitions. Word has length 25 [2020-02-10 20:22:49,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,428 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3081 transitions. [2020-02-10 20:22:49,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:49,428 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3081 transitions. [2020-02-10 20:22:49,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:49,429 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,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, 1, 1, 1] [2020-02-10 20:22:49,429 INFO L427 AbstractCegarLoop]: === Iteration 1112 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,429 INFO L82 PathProgramCache]: Analyzing trace with hash 1331414369, now seen corresponding path program 1105 times [2020-02-10 20:22:49,429 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999742904] [2020-02-10 20:22:49,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:49,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999742904] [2020-02-10 20:22:49,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:49,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:49,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894297491] [2020-02-10 20:22:49,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:49,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:49,777 INFO L87 Difference]: Start difference. First operand 771 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:22:49,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:49,915 INFO L93 Difference]: Finished difference Result 1226 states and 4319 transitions. [2020-02-10 20:22:49,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:49,915 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:49,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:49,918 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:22:49,919 INFO L226 Difference]: Without dead ends: 1213 [2020-02-10 20:22:49,919 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:49,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2020-02-10 20:22:49,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 781. [2020-02-10 20:22:49,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:22:49,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3112 transitions. [2020-02-10 20:22:49,950 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3112 transitions. Word has length 25 [2020-02-10 20:22:49,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:49,950 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3112 transitions. [2020-02-10 20:22:49,950 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:49,950 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3112 transitions. [2020-02-10 20:22:49,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:49,951 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:49,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, 1, 1, 1] [2020-02-10 20:22:49,951 INFO L427 AbstractCegarLoop]: === Iteration 1113 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:49,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:49,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1993301313, now seen corresponding path program 1106 times [2020-02-10 20:22:49,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:49,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598636163] [2020-02-10 20:22:49,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:49,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598636163] [2020-02-10 20:22:50,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:50,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280407126] [2020-02-10 20:22:50,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:50,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:50,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:50,293 INFO L87 Difference]: Start difference. First operand 781 states and 3112 transitions. Second operand 10 states. [2020-02-10 20:22:50,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:50,434 INFO L93 Difference]: Finished difference Result 1228 states and 4319 transitions. [2020-02-10 20:22:50,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:50,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:50,437 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 20:22:50,438 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:22:50,438 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:22:50,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 777. [2020-02-10 20:22:50,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:50,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:22:50,459 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:22:50,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:50,459 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:22:50,459 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:50,459 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:22:50,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:50,460 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:50,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, 1, 1, 1] [2020-02-10 20:22:50,460 INFO L427 AbstractCegarLoop]: === Iteration 1114 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:50,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:50,461 INFO L82 PathProgramCache]: Analyzing trace with hash 888515229, now seen corresponding path program 1107 times [2020-02-10 20:22:50,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:50,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328309189] [2020-02-10 20:22:50,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:50,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:50,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:50,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328309189] [2020-02-10 20:22:50,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:50,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:50,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661947246] [2020-02-10 20:22:50,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:50,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:50,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:50,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:50,806 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:22:50,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:50,962 INFO L93 Difference]: Finished difference Result 1227 states and 4317 transitions. [2020-02-10 20:22:50,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:50,962 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:50,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:50,965 INFO L225 Difference]: With dead ends: 1227 [2020-02-10 20:22:50,965 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:22:50,965 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:22:50,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 20:22:50,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:22:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:22:50,986 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:22:50,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:50,986 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:22:50,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:50,986 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:22:50,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:50,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:50,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, 1, 1, 1] [2020-02-10 20:22:50,987 INFO L427 AbstractCegarLoop]: === Iteration 1115 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:50,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:50,987 INFO L82 PathProgramCache]: Analyzing trace with hash 1879773051, now seen corresponding path program 1108 times [2020-02-10 20:22:50,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:50,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508355956] [2020-02-10 20:22:50,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508355956] [2020-02-10 20:22:51,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:51,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101529826] [2020-02-10 20:22:51,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:51,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:51,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:51,342 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:22:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,494 INFO L93 Difference]: Finished difference Result 1230 states and 4319 transitions. [2020-02-10 20:22:51,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:51,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:51,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:51,498 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:22:51,498 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:22:51,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:51,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:22:51,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 777. [2020-02-10 20:22:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:51,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:22:51,520 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:22:51,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:51,520 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:22:51,520 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:51,520 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:22:51,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:51,521 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:51,521 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:51,521 INFO L427 AbstractCegarLoop]: === Iteration 1116 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:51,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:51,521 INFO L82 PathProgramCache]: Analyzing trace with hash -1329079903, now seen corresponding path program 1109 times [2020-02-10 20:22:51,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:51,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233813482] [2020-02-10 20:22:51,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:51,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233813482] [2020-02-10 20:22:51,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:51,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:51,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692349462] [2020-02-10 20:22:51,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:51,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:51,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:51,868 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:22:51,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:51,999 INFO L93 Difference]: Finished difference Result 1233 states and 4327 transitions. [2020-02-10 20:22:52,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:52,000 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:52,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,003 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:22:52,003 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:22:52,003 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:22:52,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 20:22:52,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:22:52,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3108 transitions. [2020-02-10 20:22:52,024 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3108 transitions. Word has length 25 [2020-02-10 20:22:52,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,024 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3108 transitions. [2020-02-10 20:22:52,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:52,024 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3108 transitions. [2020-02-10 20:22:52,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:52,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,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, 1, 1, 1] [2020-02-10 20:22:52,025 INFO L427 AbstractCegarLoop]: === Iteration 1117 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1892802013, now seen corresponding path program 1110 times [2020-02-10 20:22:52,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087159350] [2020-02-10 20:22:52,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087159350] [2020-02-10 20:22:52,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:52,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83906489] [2020-02-10 20:22:52,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:52,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:52,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:52,380 INFO L87 Difference]: Start difference. First operand 783 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:22:52,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:52,519 INFO L93 Difference]: Finished difference Result 1234 states and 4323 transitions. [2020-02-10 20:22:52,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:52,519 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:52,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:52,522 INFO L225 Difference]: With dead ends: 1234 [2020-02-10 20:22:52,522 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:22:52,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:52,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:22:52,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 773. [2020-02-10 20:22:52,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:52,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3088 transitions. [2020-02-10 20:22:52,547 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3088 transitions. Word has length 25 [2020-02-10 20:22:52,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:52,547 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3088 transitions. [2020-02-10 20:22:52,547 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:52,547 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3088 transitions. [2020-02-10 20:22:52,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:52,548 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:52,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, 1, 1, 1] [2020-02-10 20:22:52,548 INFO L427 AbstractCegarLoop]: === Iteration 1118 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:52,548 INFO L82 PathProgramCache]: Analyzing trace with hash 63957191, now seen corresponding path program 1111 times [2020-02-10 20:22:52,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:52,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171339255] [2020-02-10 20:22:52,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:52,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:52,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:52,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171339255] [2020-02-10 20:22:52,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:52,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:52,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946647555] [2020-02-10 20:22:52,897 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:52,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:52,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:52,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:52,898 INFO L87 Difference]: Start difference. First operand 773 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:22:53,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:53,055 INFO L93 Difference]: Finished difference Result 1213 states and 4281 transitions. [2020-02-10 20:22:53,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:53,055 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:53,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:53,058 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:22:53,058 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:22:53,058 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:22:53,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 20:22:53,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:53,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:22:53,080 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:22:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,080 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:22:53,080 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:53,080 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:22:53,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:53,081 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,081 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:53,081 INFO L427 AbstractCegarLoop]: === Iteration 1119 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1034208805, now seen corresponding path program 1112 times [2020-02-10 20:22:53,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,082 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929512088] [2020-02-10 20:22:53,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929512088] [2020-02-10 20:22:53,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:53,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025541358] [2020-02-10 20:22:53,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:53,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:53,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:53,422 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:22:53,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:53,559 INFO L93 Difference]: Finished difference Result 1215 states and 4281 transitions. [2020-02-10 20:22:53,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:53,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:53,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:53,563 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:22:53,563 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:22:53,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:22:53,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:22:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:53,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3093 transitions. [2020-02-10 20:22:53,584 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3093 transitions. Word has length 25 [2020-02-10 20:22:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:53,584 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3093 transitions. [2020-02-10 20:22:53,585 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:53,585 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3093 transitions. [2020-02-10 20:22:53,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:53,586 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:53,586 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:53,586 INFO L427 AbstractCegarLoop]: === Iteration 1120 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:53,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:53,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1104192989, now seen corresponding path program 1113 times [2020-02-10 20:22:53,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:53,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851052486] [2020-02-10 20:22:53,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:53,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:53,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851052486] [2020-02-10 20:22:53,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:53,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:53,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77987039] [2020-02-10 20:22:53,924 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:53,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:53,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:53,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:53,924 INFO L87 Difference]: Start difference. First operand 775 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:22:54,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,067 INFO L93 Difference]: Finished difference Result 1207 states and 4265 transitions. [2020-02-10 20:22:54,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:54,068 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:54,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,071 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:22:54,071 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:22:54,071 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:54,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:22:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:22:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:54,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3096 transitions. [2020-02-10 20:22:54,093 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3096 transitions. Word has length 25 [2020-02-10 20:22:54,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,093 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3096 transitions. [2020-02-10 20:22:54,093 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3096 transitions. [2020-02-10 20:22:54,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:54,094 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,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, 1, 1, 1] [2020-02-10 20:22:54,095 INFO L427 AbstractCegarLoop]: === Iteration 1121 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,095 INFO L82 PathProgramCache]: Analyzing trace with hash 2126960123, now seen corresponding path program 1114 times [2020-02-10 20:22:54,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708536824] [2020-02-10 20:22:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:54,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:54,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708536824] [2020-02-10 20:22:54,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:54,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:54,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173325335] [2020-02-10 20:22:54,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:54,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:54,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:54,459 INFO L87 Difference]: Start difference. First operand 777 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:22:54,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:54,607 INFO L93 Difference]: Finished difference Result 1205 states and 4259 transitions. [2020-02-10 20:22:54,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:54,607 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:54,610 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:22:54,611 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:22:54,611 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:54,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:22:54,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:22:54,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:54,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:22:54,633 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:54,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:54,633 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:22:54,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:54,633 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:22:54,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:54,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:54,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:54,634 INFO L427 AbstractCegarLoop]: === Iteration 1122 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:54,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1619748409, now seen corresponding path program 1115 times [2020-02-10 20:22:54,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:54,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5556029] [2020-02-10 20:22:54,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:54,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 20:22:54,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5556029] [2020-02-10 20:22:54,971 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:54,971 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:54,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678070609] [2020-02-10 20:22:54,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:54,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:54,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:54,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:54,971 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:55,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:55,109 INFO L93 Difference]: Finished difference Result 1211 states and 4271 transitions. [2020-02-10 20:22:55,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:55,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:55,113 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 20:22:55,113 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:22:55,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:55,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:22:55,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:22:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:22:55,134 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:55,135 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:22:55,135 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:22:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:55,136 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:55,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, 1, 1, 1] [2020-02-10 20:22:55,136 INFO L427 AbstractCegarLoop]: === Iteration 1123 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:55,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 2139989085, now seen corresponding path program 1116 times [2020-02-10 20:22:55,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:55,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110804453] [2020-02-10 20:22:55,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:55,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:55,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:55,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110804453] [2020-02-10 20:22:55,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:55,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:55,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309192671] [2020-02-10 20:22:55,478 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:55,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:55,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:55,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:55,479 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:55,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:55,637 INFO L93 Difference]: Finished difference Result 1207 states and 4261 transitions. [2020-02-10 20:22:55,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:55,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:55,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:55,640 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:22:55,640 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:22:55,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:55,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:22:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 20:22:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:55,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:22:55,662 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:22:55,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:55,662 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:22:55,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:22:55,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:55,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:55,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:55,663 INFO L427 AbstractCegarLoop]: === Iteration 1124 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1223913401, now seen corresponding path program 1117 times [2020-02-10 20:22:55,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:55,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621823014] [2020-02-10 20:22:55,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:55,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:56,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:56,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621823014] [2020-02-10 20:22:56,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:56,018 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:56,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900132782] [2020-02-10 20:22:56,019 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:56,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:56,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:56,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:56,019 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:22:56,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,209 INFO L93 Difference]: Finished difference Result 1215 states and 4283 transitions. [2020-02-10 20:22:56,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:56,210 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:56,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,213 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:22:56,213 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:22:56,213 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:56,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:22:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 779. [2020-02-10 20:22:56,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:22:56,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:22:56,235 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:22:56,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,235 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:22:56,235 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:56,236 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:22:56,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:56,236 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,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, 1, 1, 1] [2020-02-10 20:22:56,237 INFO L427 AbstractCegarLoop]: === Iteration 1125 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,237 INFO L82 PathProgramCache]: Analyzing trace with hash -232655579, now seen corresponding path program 1118 times [2020-02-10 20:22:56,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10214161] [2020-02-10 20:22:56,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:56,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:56,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10214161] [2020-02-10 20:22:56,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:56,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:56,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900713893] [2020-02-10 20:22:56,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:56,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:56,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:56,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:56,587 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:22:56,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:56,775 INFO L93 Difference]: Finished difference Result 1218 states and 4285 transitions. [2020-02-10 20:22:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:56,775 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:56,779 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:22:56,779 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:22:56,779 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:56,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:22:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 775. [2020-02-10 20:22:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:56,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:22:56,800 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:22:56,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:56,800 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:22:56,800 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:56,800 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:22:56,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:56,801 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:56,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, 1, 1, 1] [2020-02-10 20:22:56,801 INFO L427 AbstractCegarLoop]: === Iteration 1126 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:56,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:56,801 INFO L82 PathProgramCache]: Analyzing trace with hash 259221537, now seen corresponding path program 1119 times [2020-02-10 20:22:56,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:56,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298829555] [2020-02-10 20:22:56,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:56,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298829555] [2020-02-10 20:22:57,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:57,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897206849] [2020-02-10 20:22:57,140 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:57,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:57,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:57,140 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:22:57,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:57,292 INFO L93 Difference]: Finished difference Result 1208 states and 4265 transitions. [2020-02-10 20:22:57,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:57,293 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:57,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:57,296 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:22:57,296 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:22:57,296 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:57,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:22:57,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:22:57,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:22:57,317 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:22:57,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,318 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:22:57,318 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:57,318 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:22:57,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:57,319 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,319 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:22:57,319 INFO L427 AbstractCegarLoop]: === Iteration 1127 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1281988671, now seen corresponding path program 1120 times [2020-02-10 20:22:57,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830602482] [2020-02-10 20:22:57,320 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:57,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:57,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830602482] [2020-02-10 20:22:57,663 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:57,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:57,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963309643] [2020-02-10 20:22:57,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:57,664 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:57,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:57,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:57,664 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:22:57,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:57,815 INFO L93 Difference]: Finished difference Result 1206 states and 4259 transitions. [2020-02-10 20:22:57,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:57,816 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:57,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:57,819 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:22:57,819 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:22:57,819 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:57,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:22:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:22:57,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:22:57,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:22:57,841 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:22:57,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:57,841 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:22:57,841 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:57,841 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:22:57,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:57,842 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:57,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, 1, 1, 1] [2020-02-10 20:22:57,842 INFO L427 AbstractCegarLoop]: === Iteration 1128 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1408354503, now seen corresponding path program 1121 times [2020-02-10 20:22:57,842 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:57,843 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978609729] [2020-02-10 20:22:57,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:57,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:58,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:58,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978609729] [2020-02-10 20:22:58,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:58,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605001857] [2020-02-10 20:22:58,191 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:58,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:58,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:58,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:58,191 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:22:58,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,347 INFO L93 Difference]: Finished difference Result 1214 states and 4275 transitions. [2020-02-10 20:22:58,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:58,347 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:58,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,350 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:22:58,350 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:22:58,351 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:58,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:22:58,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:22:58,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:22:58,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:22:58,371 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:22:58,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,372 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:22:58,372 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:58,372 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:22:58,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:58,373 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,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, 1, 1, 1] [2020-02-10 20:22:58,373 INFO L427 AbstractCegarLoop]: === Iteration 1129 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1946210081, now seen corresponding path program 1122 times [2020-02-10 20:22:58,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126037118] [2020-02-10 20:22:58,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:58,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 20:22:58,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126037118] [2020-02-10 20:22:58,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:58,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:58,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319538247] [2020-02-10 20:22:58,721 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:58,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:58,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:58,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:58,721 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:22:58,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:58,920 INFO L93 Difference]: Finished difference Result 1209 states and 4263 transitions. [2020-02-10 20:22:58,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:58,921 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:58,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:58,924 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:22:58,924 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:22:58,924 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:58,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:22:58,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 773. [2020-02-10 20:22:58,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:22:58,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:22:58,945 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:22:58,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:58,945 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:22:58,945 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:58,945 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:22:58,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:58,946 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:58,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, 1, 1, 1] [2020-02-10 20:22:58,946 INFO L427 AbstractCegarLoop]: === Iteration 1130 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:58,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:58,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1997374913, now seen corresponding path program 1123 times [2020-02-10 20:22:58,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:58,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768393119] [2020-02-10 20:22:58,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768393119] [2020-02-10 20:22:59,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:59,296 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210134898] [2020-02-10 20:22:59,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:59,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:59,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:59,296 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:22:59,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,462 INFO L93 Difference]: Finished difference Result 1225 states and 4305 transitions. [2020-02-10 20:22:59,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:59,462 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:59,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,466 INFO L225 Difference]: With dead ends: 1225 [2020-02-10 20:22:59,466 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:22:59,466 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:59,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:22:59,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 20:22:59,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:22:59,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:22:59,487 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:22:59,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:22:59,487 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:22:59,487 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:22:59,487 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:22:59,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:22:59,488 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:22:59,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, 1, 1, 1] [2020-02-10 20:22:59,488 INFO L427 AbstractCegarLoop]: === Iteration 1131 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:22:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:22:59,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1224507003, now seen corresponding path program 1124 times [2020-02-10 20:22:59,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:22:59,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167867711] [2020-02-10 20:22:59,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:22:59,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:22:59,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:22:59,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167867711] [2020-02-10 20:22:59,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:22:59,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:22:59,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330716374] [2020-02-10 20:22:59,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:22:59,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:22:59,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:22:59,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:22:59,840 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:22:59,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:22:59,982 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:22:59,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:22:59,983 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:22:59,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:22:59,986 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:22:59,986 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:22:59,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:22:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:23:00,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 775. [2020-02-10 20:23:00,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:00,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:23:00,007 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:00,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:00,008 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:23:00,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:00,008 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:23:00,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:00,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:00,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, 1, 1, 1] [2020-02-10 20:23:00,009 INFO L427 AbstractCegarLoop]: === Iteration 1132 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:00,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:00,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1791246117, now seen corresponding path program 1125 times [2020-02-10 20:23:00,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:00,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501904556] [2020-02-10 20:23:00,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:00,349 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501904556] [2020-02-10 20:23:00,349 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,349 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:00,349 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739597650] [2020-02-10 20:23:00,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:00,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:00,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:00,350 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:00,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:00,535 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:23:00,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:00,536 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:00,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:00,539 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:00,539 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:23:00,539 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:23:00,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 20:23:00,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:00,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:23:00,560 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:00,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:00,561 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:23:00,561 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:00,561 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:23:00,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:00,562 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:00,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, 1, 1, 1] [2020-02-10 20:23:00,562 INFO L427 AbstractCegarLoop]: === Iteration 1133 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:00,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:00,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1256016315, now seen corresponding path program 1126 times [2020-02-10 20:23:00,562 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:00,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028412076] [2020-02-10 20:23:00,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:00,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:00,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:00,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028412076] [2020-02-10 20:23:00,898 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:00,898 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:00,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422691734] [2020-02-10 20:23:00,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:00,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:00,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:00,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:00,899 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:23:01,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,075 INFO L93 Difference]: Finished difference Result 1212 states and 4271 transitions. [2020-02-10 20:23:01,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:01,075 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,078 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:23:01,079 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:23:01,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:01,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:23:01,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 20:23:01,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:01,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:01,100 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:01,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,100 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:01,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:01,100 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:01,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:01,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,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, 1, 1, 1] [2020-02-10 20:23:01,101 INFO L427 AbstractCegarLoop]: === Iteration 1134 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1812252325, now seen corresponding path program 1127 times [2020-02-10 20:23:01,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,101 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560181934] [2020-02-10 20:23:01,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:01,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:01,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560181934] [2020-02-10 20:23:01,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:01,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:01,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457898782] [2020-02-10 20:23:01,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:01,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:01,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:01,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:01,445 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:01,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:01,596 INFO L93 Difference]: Finished difference Result 1218 states and 4283 transitions. [2020-02-10 20:23:01,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:01,596 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:01,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:01,599 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:23:01,600 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:01,600 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:01,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:01,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:23:01,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:01,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:01,621 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:01,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:01,621 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:01,621 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:01,621 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:01,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:01,622 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:01,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, 1, 1, 1] [2020-02-10 20:23:01,622 INFO L427 AbstractCegarLoop]: === Iteration 1135 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:01,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:01,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1944859393, now seen corresponding path program 1128 times [2020-02-10 20:23:01,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:01,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7673717] [2020-02-10 20:23:01,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:01,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:01,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7673717] [2020-02-10 20:23:01,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:01,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:01,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852559853] [2020-02-10 20:23:01,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:01,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:01,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:01,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:01,974 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:02,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:02,128 INFO L93 Difference]: Finished difference Result 1213 states and 4271 transitions. [2020-02-10 20:23:02,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:02,129 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:02,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:02,132 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:23:02,132 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:02,132 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:02,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:02,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 771. [2020-02-10 20:23:02,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:23:02,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:23:02,153 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:23:02,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:02,153 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:23:02,153 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:02,153 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:23:02,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:02,154 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:02,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, 1, 1, 1] [2020-02-10 20:23:02,154 INFO L427 AbstractCegarLoop]: === Iteration 1136 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 696773025, now seen corresponding path program 1129 times [2020-02-10 20:23:02,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:02,155 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092189833] [2020-02-10 20:23:02,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:02,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:02,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:02,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092189833] [2020-02-10 20:23:02,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:02,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:02,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569170367] [2020-02-10 20:23:02,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:02,530 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:02,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:02,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:02,531 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:23:02,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:02,682 INFO L93 Difference]: Finished difference Result 1220 states and 4303 transitions. [2020-02-10 20:23:02,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:02,682 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:02,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:02,685 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:02,685 INFO L226 Difference]: Without dead ends: 1207 [2020-02-10 20:23:02,686 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:02,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1207 states. [2020-02-10 20:23:02,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1207 to 781. [2020-02-10 20:23:02,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:02,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:23:02,707 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:23:02,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:02,707 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:23:02,707 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:02,707 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:23:02,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:02,708 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:02,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, 1, 1, 1] [2020-02-10 20:23:02,708 INFO L427 AbstractCegarLoop]: === Iteration 1137 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:02,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:02,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1667024639, now seen corresponding path program 1130 times [2020-02-10 20:23:02,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:02,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006948451] [2020-02-10 20:23:02,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:03,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 20:23:03,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006948451] [2020-02-10 20:23:03,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:03,079 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:03,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861838810] [2020-02-10 20:23:03,079 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:03,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:03,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:03,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:03,079 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:23:03,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,250 INFO L93 Difference]: Finished difference Result 1222 states and 4303 transitions. [2020-02-10 20:23:03,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:03,250 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:03,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,253 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:23:03,254 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:23:03,254 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:03,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:23:03,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 777. [2020-02-10 20:23:03,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:03,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3099 transitions. [2020-02-10 20:23:03,275 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3099 transitions. Word has length 25 [2020-02-10 20:23:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,275 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3099 transitions. [2020-02-10 20:23:03,275 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:03,275 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3099 transitions. [2020-02-10 20:23:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:03,276 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:03,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, 1, 1, 1] [2020-02-10 20:23:03,276 INFO L427 AbstractCegarLoop]: === Iteration 1138 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,276 INFO L82 PathProgramCache]: Analyzing trace with hash -2115059333, now seen corresponding path program 1131 times [2020-02-10 20:23:03,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862355994] [2020-02-10 20:23:03,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:03,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:03,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862355994] [2020-02-10 20:23:03,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:03,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:03,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181276808] [2020-02-10 20:23:03,659 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:03,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:03,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:03,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:03,659 INFO L87 Difference]: Start difference. First operand 777 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:23:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:03,822 INFO L93 Difference]: Finished difference Result 1219 states and 4297 transitions. [2020-02-10 20:23:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:03,823 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:03,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:03,826 INFO L225 Difference]: With dead ends: 1219 [2020-02-10 20:23:03,826 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:23:03,826 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:23:03,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 781. [2020-02-10 20:23:03,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 20:23:03,848 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 20:23:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:03,848 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 20:23:03,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:03,848 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 20:23:03,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:03,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23: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, 1, 1, 1] [2020-02-10 20:23:03,849 INFO L427 AbstractCegarLoop]: === Iteration 1139 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:03,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:03,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1113298407, now seen corresponding path program 1132 times [2020-02-10 20:23:03,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:03,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477675660] [2020-02-10 20:23:03,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:03,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,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 20:23:04,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477675660] [2020-02-10 20:23:04,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:04,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756638611] [2020-02-10 20:23:04,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:04,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:04,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:04,217 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:23:04,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,360 INFO L93 Difference]: Finished difference Result 1220 states and 4295 transitions. [2020-02-10 20:23:04,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:04,361 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:04,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,364 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:04,364 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:04,364 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:04,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:23:04,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:04,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:23:04,386 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:23:04,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,386 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:23:04,386 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:23:04,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:04,387 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,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, 1, 1, 1] [2020-02-10 20:23:04,387 INFO L427 AbstractCegarLoop]: === Iteration 1140 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1638125023, now seen corresponding path program 1133 times [2020-02-10 20:23:04,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46524064] [2020-02-10 20:23:04,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:04,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:04,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46524064] [2020-02-10 20:23:04,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:04,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:04,757 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104750814] [2020-02-10 20:23:04,758 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:04,758 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:04,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:04,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:04,758 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:23:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:04,904 INFO L93 Difference]: Finished difference Result 1224 states and 4304 transitions. [2020-02-10 20:23:04,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:04,905 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:04,908 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:23:04,908 INFO L226 Difference]: Without dead ends: 1209 [2020-02-10 20:23:04,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2020-02-10 20:23:04,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 782. [2020-02-10 20:23:04,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:23:04,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3104 transitions. [2020-02-10 20:23:04,930 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3104 transitions. Word has length 25 [2020-02-10 20:23:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:04,930 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3104 transitions. [2020-02-10 20:23:04,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:04,930 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3104 transitions. [2020-02-10 20:23:04,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:04,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:04,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, 1, 1, 1] [2020-02-10 20:23:04,931 INFO L427 AbstractCegarLoop]: === Iteration 1141 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:04,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1100269445, now seen corresponding path program 1134 times [2020-02-10 20:23:04,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:04,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150084232] [2020-02-10 20:23:04,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:05,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150084232] [2020-02-10 20:23:05,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:05,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:05,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988514292] [2020-02-10 20:23:05,304 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:05,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:05,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:05,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:05,304 INFO L87 Difference]: Start difference. First operand 782 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:23:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,455 INFO L93 Difference]: Finished difference Result 1223 states and 4297 transitions. [2020-02-10 20:23:05,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:05,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,459 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:23:05,459 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:23:05,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:05,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:23:05,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 773. [2020-02-10 20:23:05,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:05,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:23:05,480 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:05,480 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:23:05,481 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:05,481 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:23:05,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:05,482 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:05,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, 1, 1, 1] [2020-02-10 20:23:05,482 INFO L427 AbstractCegarLoop]: === Iteration 1142 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:05,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:05,482 INFO L82 PathProgramCache]: Analyzing trace with hash -148198427, now seen corresponding path program 1135 times [2020-02-10 20:23:05,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:05,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878391781] [2020-02-10 20:23:05,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:05,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:05,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878391781] [2020-02-10 20:23:05,838 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:05,838 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:05,838 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668883533] [2020-02-10 20:23:05,839 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:05,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:05,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:05,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:05,839 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:05,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:05,985 INFO L93 Difference]: Finished difference Result 1210 states and 4272 transitions. [2020-02-10 20:23:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:05,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:05,989 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:05,989 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:23:05,990 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:06,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:23:06,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 779. [2020-02-10 20:23:06,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:06,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3100 transitions. [2020-02-10 20:23:06,011 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:06,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,011 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3100 transitions. [2020-02-10 20:23:06,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:06,011 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3100 transitions. [2020-02-10 20:23:06,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:06,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:06,012 INFO L427 AbstractCegarLoop]: === Iteration 1143 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,012 INFO L82 PathProgramCache]: Analyzing trace with hash 822053187, now seen corresponding path program 1136 times [2020-02-10 20:23:06,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571707058] [2020-02-10 20:23:06,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,367 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571707058] [2020-02-10 20:23:06,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:06,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094578090] [2020-02-10 20:23:06,367 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:06,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:06,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:06,368 INFO L87 Difference]: Start difference. First operand 779 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:06,505 INFO L93 Difference]: Finished difference Result 1212 states and 4272 transitions. [2020-02-10 20:23:06,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:06,506 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:06,509 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:23:06,509 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:06,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:06,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:06,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:23:06,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:23:06,531 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:23:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:06,531 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:23:06,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:23:06,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:06,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:06,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, 1, 1, 1] [2020-02-10 20:23:06,532 INFO L427 AbstractCegarLoop]: === Iteration 1144 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:06,533 INFO L82 PathProgramCache]: Analyzing trace with hash 892037371, now seen corresponding path program 1137 times [2020-02-10 20:23:06,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:06,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510716277] [2020-02-10 20:23:06,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:06,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:06,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510716277] [2020-02-10 20:23:06,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:06,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:06,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654898669] [2020-02-10 20:23:06,887 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:06,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:06,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:06,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:06,887 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:23:07,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:07,028 INFO L93 Difference]: Finished difference Result 1204 states and 4256 transitions. [2020-02-10 20:23:07,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:07,029 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:07,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:07,032 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:07,032 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:07,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:07,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:07,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:23:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:07,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:23:07,053 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:23:07,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:07,053 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:23:07,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:07,054 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:23:07,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:07,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:07,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, 1, 1, 1] [2020-02-10 20:23:07,055 INFO L427 AbstractCegarLoop]: === Iteration 1145 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:07,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:07,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1914804505, now seen corresponding path program 1138 times [2020-02-10 20:23:07,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:07,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106604207] [2020-02-10 20:23:07,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106604207] [2020-02-10 20:23:07,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,416 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:07,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487146582] [2020-02-10 20:23:07,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:07,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:07,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:07,416 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:23:07,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:07,577 INFO L93 Difference]: Finished difference Result 1202 states and 4250 transitions. [2020-02-10 20:23:07,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:07,578 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:07,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:07,581 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:23:07,581 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:23:07,581 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:07,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:23:07,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 20:23:07,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:07,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:23:07,603 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:07,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:07,603 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:23:07,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:23:07,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:07,604 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:07,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, 1, 1, 1] [2020-02-10 20:23:07,604 INFO L427 AbstractCegarLoop]: === Iteration 1146 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:07,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:07,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1831904027, now seen corresponding path program 1139 times [2020-02-10 20:23:07,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:07,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279030769] [2020-02-10 20:23:07,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:07,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:07,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279030769] [2020-02-10 20:23:07,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:07,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:07,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33913476] [2020-02-10 20:23:07,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:07,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:07,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:07,974 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,116 INFO L93 Difference]: Finished difference Result 1208 states and 4262 transitions. [2020-02-10 20:23:08,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:08,116 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,120 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:08,120 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:08,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:08,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:08,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:23:08,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:08,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:23:08,141 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:08,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,142 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:23:08,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:08,142 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:23:08,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:08,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,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, 1, 1, 1] [2020-02-10 20:23:08,143 INFO L427 AbstractCegarLoop]: === Iteration 1147 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1927833467, now seen corresponding path program 1140 times [2020-02-10 20:23:08,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589529790] [2020-02-10 20:23:08,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:08,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 20:23:08,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589529790] [2020-02-10 20:23:08,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:08,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:08,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595743723] [2020-02-10 20:23:08,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:08,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:08,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:08,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:08,498 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:23:08,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:08,644 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:23:08,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:08,645 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:08,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:08,648 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:08,648 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:23:08,648 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:23:08,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 20:23:08,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:23:08,670 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:23:08,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:08,670 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:23:08,670 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:08,670 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:23:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:08,671 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:08,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, 1, 1, 1] [2020-02-10 20:23:08,671 INFO L427 AbstractCegarLoop]: === Iteration 1148 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:08,672 INFO L82 PathProgramCache]: Analyzing trace with hash 67479333, now seen corresponding path program 1141 times [2020-02-10 20:23:08,672 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:08,672 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054446728] [2020-02-10 20:23:08,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:09,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054446728] [2020-02-10 20:23:09,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:09,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [396572371] [2020-02-10 20:23:09,031 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:09,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:09,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:09,031 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:23:09,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,176 INFO L93 Difference]: Finished difference Result 1208 states and 4266 transitions. [2020-02-10 20:23:09,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:09,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:09,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,179 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:09,179 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:23:09,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:23:09,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 779. [2020-02-10 20:23:09,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:09,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:23:09,201 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:09,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,201 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:23:09,201 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:09,201 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:23:09,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:09,202 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,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, 1, 1, 1] [2020-02-10 20:23:09,202 INFO L427 AbstractCegarLoop]: === Iteration 1149 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1069240259, now seen corresponding path program 1142 times [2020-02-10 20:23:09,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142800803] [2020-02-10 20:23:09,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:09,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 20:23:09,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142800803] [2020-02-10 20:23:09,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:09,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:09,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034563297] [2020-02-10 20:23:09,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:09,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:09,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:09,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:09,563 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:09,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:09,701 INFO L93 Difference]: Finished difference Result 1209 states and 4264 transitions. [2020-02-10 20:23:09,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:09,701 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:09,704 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:23:09,704 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:09,705 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:09,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:09,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 20:23:09,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:09,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:23:09,725 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:09,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:09,725 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:23:09,725 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:09,725 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:23:09,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:09,726 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:09,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, 1, 1, 1] [2020-02-10 20:23:09,727 INFO L427 AbstractCegarLoop]: === Iteration 1150 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:09,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:09,727 INFO L82 PathProgramCache]: Analyzing trace with hash -375419807, now seen corresponding path program 1143 times [2020-02-10 20:23:09,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:09,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077170636] [2020-02-10 20:23:09,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:10,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:10,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077170636] [2020-02-10 20:23:10,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:10,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:10,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591364573] [2020-02-10 20:23:10,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:10,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:10,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:10,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:10,088 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:10,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,222 INFO L93 Difference]: Finished difference Result 1203 states and 4252 transitions. [2020-02-10 20:23:10,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:10,222 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:10,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,225 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:23:10,225 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:23:10,226 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:10,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:23:10,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:23:10,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:23:10,246 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:10,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,246 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:23:10,247 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:10,247 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:23:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:10,248 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,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, 1, 1, 1] [2020-02-10 20:23:10,248 INFO L427 AbstractCegarLoop]: === Iteration 1151 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,248 INFO L82 PathProgramCache]: Analyzing trace with hash 647347327, now seen corresponding path program 1144 times [2020-02-10 20:23:10,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765763645] [2020-02-10 20:23:10,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:10,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:10,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765763645] [2020-02-10 20:23:10,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:10,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:10,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331936557] [2020-02-10 20:23:10,642 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:10,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:10,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:10,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:10,643 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:23:10,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:10,778 INFO L93 Difference]: Finished difference Result 1201 states and 4246 transitions. [2020-02-10 20:23:10,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:10,778 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:10,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:10,782 INFO L225 Difference]: With dead ends: 1201 [2020-02-10 20:23:10,782 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:23:10,782 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:23:10,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 775. [2020-02-10 20:23:10,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:10,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:10,803 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:10,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:10,803 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:10,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:10,804 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:10,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:10,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:10,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, 1, 1, 1] [2020-02-10 20:23:10,805 INFO L427 AbstractCegarLoop]: === Iteration 1152 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:10,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:10,805 INFO L82 PathProgramCache]: Analyzing trace with hash -1584716955, now seen corresponding path program 1145 times [2020-02-10 20:23:10,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:10,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401315845] [2020-02-10 20:23:10,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:10,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,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 20:23:11,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401315845] [2020-02-10 20:23:11,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:11,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502966728] [2020-02-10 20:23:11,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:11,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:11,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:11,166 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:11,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,312 INFO L93 Difference]: Finished difference Result 1205 states and 4254 transitions. [2020-02-10 20:23:11,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:11,312 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:11,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,315 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:23:11,315 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:11,316 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:11,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:23:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:11,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:11,337 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:11,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,337 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:11,337 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:11,337 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:11,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:11,338 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,338 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:11,338 INFO L427 AbstractCegarLoop]: === Iteration 1153 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1637164961, now seen corresponding path program 1146 times [2020-02-10 20:23:11,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985097400] [2020-02-10 20:23:11,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:11,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:11,701 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985097400] [2020-02-10 20:23:11,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:11,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:11,702 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866584473] [2020-02-10 20:23:11,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:11,702 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:11,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:11,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:11,702 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:11,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:11,839 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 20:23:11,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:11,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:11,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:11,843 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:23:11,843 INFO L226 Difference]: Without dead ends: 1187 [2020-02-10 20:23:11,843 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2020-02-10 20:23:11,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 773. [2020-02-10 20:23:11,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:11,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:23:11,864 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:23:11,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:11,865 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:23:11,865 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:11,865 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:23:11,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:11,866 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:11,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, 1, 1, 1] [2020-02-10 20:23:11,866 INFO L427 AbstractCegarLoop]: === Iteration 1154 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:11,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:11,866 INFO L82 PathProgramCache]: Analyzing trace with hash 1988547263, now seen corresponding path program 1147 times [2020-02-10 20:23:11,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:11,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878556875] [2020-02-10 20:23:11,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:11,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878556875] [2020-02-10 20:23:12,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:12,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472195927] [2020-02-10 20:23:12,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:12,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:12,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:12,239 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:23:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:12,392 INFO L93 Difference]: Finished difference Result 1216 states and 4282 transitions. [2020-02-10 20:23:12,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:12,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:12,396 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:12,396 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:23:12,396 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:12,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:23:12,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 780. [2020-02-10 20:23:12,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:12,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3098 transitions. [2020-02-10 20:23:12,417 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:12,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:12,417 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3098 transitions. [2020-02-10 20:23:12,417 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:12,417 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3098 transitions. [2020-02-10 20:23:12,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:12,418 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:12,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, 1, 1, 1] [2020-02-10 20:23:12,419 INFO L427 AbstractCegarLoop]: === Iteration 1155 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:12,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:12,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1768564455, now seen corresponding path program 1148 times [2020-02-10 20:23:12,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:12,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711106531] [2020-02-10 20:23:12,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:12,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:12,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711106531] [2020-02-10 20:23:12,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:12,797 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:12,797 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093593652] [2020-02-10 20:23:12,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:12,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:12,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:12,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:12,798 INFO L87 Difference]: Start difference. First operand 780 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:12,950 INFO L93 Difference]: Finished difference Result 1215 states and 4275 transitions. [2020-02-10 20:23:12,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:12,951 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:12,955 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:23:12,955 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:12,955 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:12,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:23:12,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:12,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:12,979 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:12,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:12,979 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:12,979 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:12,979 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:12,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:12,980 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:12,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, 1, 1, 1] [2020-02-10 20:23:12,980 INFO L427 AbstractCegarLoop]: === Iteration 1156 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:12,981 INFO L82 PathProgramCache]: Analyzing trace with hash -1212328445, now seen corresponding path program 1149 times [2020-02-10 20:23:12,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:12,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596297527] [2020-02-10 20:23:12,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:13,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:13,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596297527] [2020-02-10 20:23:13,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:13,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:13,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428578179] [2020-02-10 20:23:13,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:13,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:13,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:13,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:13,334 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:13,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,468 INFO L93 Difference]: Finished difference Result 1210 states and 4265 transitions. [2020-02-10 20:23:13,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:13,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:13,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,472 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:13,472 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:23:13,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:13,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:23:13,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:23:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:13,495 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:13,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:13,495 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:13,495 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:13,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:13,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, 1, 1, 1] [2020-02-10 20:23:13,496 INFO L427 AbstractCegarLoop]: === Iteration 1157 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:13,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1747558247, now seen corresponding path program 1150 times [2020-02-10 20:23:13,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:13,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259124428] [2020-02-10 20:23:13,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:13,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:13,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259124428] [2020-02-10 20:23:13,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:13,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:13,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696986981] [2020-02-10 20:23:13,842 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:13,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:13,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:13,842 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:13,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:13,989 INFO L93 Difference]: Finished difference Result 1206 states and 4255 transitions. [2020-02-10 20:23:13,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:13,990 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:13,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:13,993 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:23:13,993 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:13,993 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:14,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:14,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 775. [2020-02-10 20:23:14,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:14,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:23:14,014 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:23:14,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,015 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:23:14,015 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:14,015 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:23:14,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:14,016 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,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, 1, 1, 1] [2020-02-10 20:23:14,016 INFO L427 AbstractCegarLoop]: === Iteration 1158 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1180819133, now seen corresponding path program 1151 times [2020-02-10 20:23:14,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,016 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528763152] [2020-02-10 20:23:14,016 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528763152] [2020-02-10 20:23:14,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:14,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279324886] [2020-02-10 20:23:14,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:14,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:14,371 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:23:14,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:14,517 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 20:23:14,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:14,517 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:14,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:14,521 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:14,521 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:23:14,521 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:14,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:23:14,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:23:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:14,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:23:14,542 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:23:14,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:14,542 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:23:14,542 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:14,543 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:23:14,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:14,544 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:14,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, 1, 1, 1] [2020-02-10 20:23:14,544 INFO L427 AbstractCegarLoop]: === Iteration 1159 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:14,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:14,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2041062783, now seen corresponding path program 1152 times [2020-02-10 20:23:14,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:14,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385560888] [2020-02-10 20:23:14,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:14,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:14,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:14,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385560888] [2020-02-10 20:23:14,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:14,881 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:14,881 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949252217] [2020-02-10 20:23:14,881 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:14,881 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:14,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:14,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:14,882 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:23:15,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,012 INFO L93 Difference]: Finished difference Result 1205 states and 4251 transitions. [2020-02-10 20:23:15,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:15,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:15,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,016 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:23:15,016 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:23:15,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:15,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:23:15,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 771. [2020-02-10 20:23:15,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:23:15,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:23:15,037 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:23:15,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,037 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:23:15,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:23:15,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:15,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,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, 1, 1, 1] [2020-02-10 20:23:15,038 INFO L427 AbstractCegarLoop]: === Iteration 1160 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,039 INFO L82 PathProgramCache]: Analyzing trace with hash -1015408803, now seen corresponding path program 1153 times [2020-02-10 20:23:15,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101994605] [2020-02-10 20:23:15,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101994605] [2020-02-10 20:23:15,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:15,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962470523] [2020-02-10 20:23:15,380 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:15,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:15,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:15,380 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:23:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:15,519 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 20:23:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:15,520 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:15,523 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:23:15,523 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:23:15,523 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:23:15,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 781. [2020-02-10 20:23:15,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:15,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3108 transitions. [2020-02-10 20:23:15,544 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3108 transitions. Word has length 25 [2020-02-10 20:23:15,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:15,545 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3108 transitions. [2020-02-10 20:23:15,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:15,545 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3108 transitions. [2020-02-10 20:23:15,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:15,546 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:15,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, 1, 1, 1] [2020-02-10 20:23:15,546 INFO L427 AbstractCegarLoop]: === Iteration 1161 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:15,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:15,546 INFO L82 PathProgramCache]: Analyzing trace with hash -24150981, now seen corresponding path program 1154 times [2020-02-10 20:23:15,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:15,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119515764] [2020-02-10 20:23:15,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:15,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:15,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:15,892 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119515764] [2020-02-10 20:23:15,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:15,893 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:15,893 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552454428] [2020-02-10 20:23:15,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:15,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:15,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:15,893 INFO L87 Difference]: Start difference. First operand 781 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:23:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,033 INFO L93 Difference]: Finished difference Result 1226 states and 4309 transitions. [2020-02-10 20:23:16,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:16,033 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,037 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:23:16,037 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:23:16,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:16,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:23:16,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 20:23:16,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:16,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:23:16,059 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:23:16,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,059 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:23:16,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:16,059 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:23:16,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:16,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,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, 1, 1, 1] [2020-02-10 20:23:16,060 INFO L427 AbstractCegarLoop]: === Iteration 1162 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,060 INFO L82 PathProgramCache]: Analyzing trace with hash 910625275, now seen corresponding path program 1155 times [2020-02-10 20:23:16,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,060 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883363576] [2020-02-10 20:23:16,060 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,417 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883363576] [2020-02-10 20:23:16,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:16,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863283211] [2020-02-10 20:23:16,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:16,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:16,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:16,418 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:23:16,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:16,550 INFO L93 Difference]: Finished difference Result 1221 states and 4299 transitions. [2020-02-10 20:23:16,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:16,550 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:16,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:16,554 INFO L225 Difference]: With dead ends: 1221 [2020-02-10 20:23:16,554 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:23:16,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:16,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:23:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 781. [2020-02-10 20:23:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3104 transitions. [2020-02-10 20:23:16,575 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3104 transitions. Word has length 25 [2020-02-10 20:23:16,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:16,576 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3104 transitions. [2020-02-10 20:23:16,576 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:16,576 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3104 transitions. [2020-02-10 20:23:16,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:16,577 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:16,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, 1, 1, 1] [2020-02-10 20:23:16,577 INFO L427 AbstractCegarLoop]: === Iteration 1163 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:16,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:16,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1912386201, now seen corresponding path program 1156 times [2020-02-10 20:23:16,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:16,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255475673] [2020-02-10 20:23:16,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:16,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:16,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:16,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255475673] [2020-02-10 20:23:16,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:16,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:16,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749579560] [2020-02-10 20:23:16,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:16,921 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:16,921 INFO L87 Difference]: Start difference. First operand 781 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:23:17,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:17,075 INFO L93 Difference]: Finished difference Result 1222 states and 4297 transitions. [2020-02-10 20:23:17,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:17,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:17,079 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:23:17,079 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:23:17,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:17,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:23:17,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:23:17,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:17,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3093 transitions. [2020-02-10 20:23:17,101 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3093 transitions. Word has length 25 [2020-02-10 20:23:17,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:17,101 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3093 transitions. [2020-02-10 20:23:17,101 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:17,101 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3093 transitions. [2020-02-10 20:23:17,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:17,102 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:17,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, 1, 1, 1] [2020-02-10 20:23:17,102 INFO L427 AbstractCegarLoop]: === Iteration 1164 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:17,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:17,102 INFO L82 PathProgramCache]: Analyzing trace with hash 965666653, now seen corresponding path program 1157 times [2020-02-10 20:23:17,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:17,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449750279] [2020-02-10 20:23:17,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:17,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449750279] [2020-02-10 20:23:17,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:17,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070059368] [2020-02-10 20:23:17,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:17,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:17,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:17,452 INFO L87 Difference]: Start difference. First operand 777 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:23:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:17,590 INFO L93 Difference]: Finished difference Result 1228 states and 4310 transitions. [2020-02-10 20:23:17,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:17,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:17,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:17,593 INFO L225 Difference]: With dead ends: 1228 [2020-02-10 20:23:17,593 INFO L226 Difference]: Without dead ends: 1212 [2020-02-10 20:23:17,594 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:17,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2020-02-10 20:23:17,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 782. [2020-02-10 20:23:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:23:17,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3102 transitions. [2020-02-10 20:23:17,614 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3102 transitions. Word has length 25 [2020-02-10 20:23:17,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:17,615 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3102 transitions. [2020-02-10 20:23:17,615 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:17,615 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3102 transitions. [2020-02-10 20:23:17,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:17,616 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:17,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, 1, 1, 1] [2020-02-10 20:23:17,616 INFO L427 AbstractCegarLoop]: === Iteration 1165 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:17,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:17,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1718359685, now seen corresponding path program 1158 times [2020-02-10 20:23:17,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:17,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716673418] [2020-02-10 20:23:17,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:17,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 20:23:17,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716673418] [2020-02-10 20:23:17,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:17,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:17,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250352693] [2020-02-10 20:23:17,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:17,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:17,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:17,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:17,980 INFO L87 Difference]: Start difference. First operand 782 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:23:18,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,110 INFO L93 Difference]: Finished difference Result 1226 states and 4301 transitions. [2020-02-10 20:23:18,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:18,111 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:18,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,114 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:23:18,114 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:23:18,114 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:18,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:23:18,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 773. [2020-02-10 20:23:18,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:18,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:23:18,137 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:23:18,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,137 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:23:18,137 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:18,137 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:23:18,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:18,138 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,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, 1, 1, 1] [2020-02-10 20:23:18,138 INFO L427 AbstractCegarLoop]: === Iteration 1166 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1860380255, now seen corresponding path program 1159 times [2020-02-10 20:23:18,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824076217] [2020-02-10 20:23:18,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824076217] [2020-02-10 20:23:18,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:18,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712947608] [2020-02-10 20:23:18,481 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:18,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:18,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:18,481 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:23:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:18,606 INFO L93 Difference]: Finished difference Result 1213 states and 4276 transitions. [2020-02-10 20:23:18,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:18,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:18,609 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:23:18,609 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:23:18,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:18,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:23:18,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 779. [2020-02-10 20:23:18,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:23:18,630 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:18,630 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:23:18,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:18,631 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:23:18,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:18,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:18,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, 1, 1, 1] [2020-02-10 20:23:18,632 INFO L427 AbstractCegarLoop]: === Iteration 1167 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:18,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:18,632 INFO L82 PathProgramCache]: Analyzing trace with hash -869122433, now seen corresponding path program 1160 times [2020-02-10 20:23:18,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:18,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40230330] [2020-02-10 20:23:18,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:18,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:18,972 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40230330] [2020-02-10 20:23:18,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:18,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:18,972 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676643117] [2020-02-10 20:23:18,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:18,972 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:18,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:18,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:18,972 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:19,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,109 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 20:23:19,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:19,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:19,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,112 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:19,113 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:19,113 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:19,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:19,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:23:19,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:19,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:23:19,134 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:19,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,134 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:23:19,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:19,134 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:23:19,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:19,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,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, 1, 1, 1] [2020-02-10 20:23:19,135 INFO L427 AbstractCegarLoop]: === Iteration 1168 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,136 INFO L82 PathProgramCache]: Analyzing trace with hash -377245317, now seen corresponding path program 1161 times [2020-02-10 20:23:19,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751373225] [2020-02-10 20:23:19,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:19,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:19,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751373225] [2020-02-10 20:23:19,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:19,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:19,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864990106] [2020-02-10 20:23:19,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:19,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:19,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:19,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:19,476 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:19,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:19,624 INFO L93 Difference]: Finished difference Result 1206 states and 4258 transitions. [2020-02-10 20:23:19,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:19,624 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:19,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:19,627 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:23:19,627 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:19,628 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:19,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:19,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:23:19,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:23:19,649 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:19,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:19,649 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:23:19,649 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:19,649 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:23:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:19,650 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:19,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, 1, 1, 1] [2020-02-10 20:23:19,650 INFO L427 AbstractCegarLoop]: === Iteration 1169 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:19,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:19,650 INFO L82 PathProgramCache]: Analyzing trace with hash 645521817, now seen corresponding path program 1162 times [2020-02-10 20:23:19,650 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:19,650 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060351558] [2020-02-10 20:23:19,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:19,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:19,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:19,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060351558] [2020-02-10 20:23:19,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:19,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:19,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566288390] [2020-02-10 20:23:19,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:19,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:20,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:20,000 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:23:20,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,154 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:23:20,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:20,154 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,158 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:20,158 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:20,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:20,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 775. [2020-02-10 20:23:20,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:20,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:20,179 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,179 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:20,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:20,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,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, 1, 1, 1] [2020-02-10 20:23:20,180 INFO L427 AbstractCegarLoop]: === Iteration 1170 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 771887649, now seen corresponding path program 1163 times [2020-02-10 20:23:20,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040395637] [2020-02-10 20:23:20,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:20,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040395637] [2020-02-10 20:23:20,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:20,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:20,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535999113] [2020-02-10 20:23:20,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:20,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:20,516 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:20,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:20,690 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:23:20,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:20,690 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:20,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:20,694 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:23:20,694 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:20,694 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:20,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:20,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:23:20,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:20,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:20,715 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:20,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:20,716 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:20,716 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:20,716 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:20,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:20,717 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:20,717 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:20,717 INFO L427 AbstractCegarLoop]: === Iteration 1171 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:20,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:20,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1309743227, now seen corresponding path program 1164 times [2020-02-10 20:23:20,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:20,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570382435] [2020-02-10 20:23:20,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570382435] [2020-02-10 20:23:21,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:21,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643562716] [2020-02-10 20:23:21,059 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:21,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:21,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:21,060 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,217 INFO L93 Difference]: Finished difference Result 1207 states and 4256 transitions. [2020-02-10 20:23:21,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:21,218 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,221 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:23:21,221 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:23:21,221 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:21,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:23:21,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 773. [2020-02-10 20:23:21,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:23:21,243 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:23:21,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,243 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:23:21,243 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:21,243 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:23:21,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:21,244 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,244 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:21,244 INFO L427 AbstractCegarLoop]: === Iteration 1172 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,244 INFO L82 PathProgramCache]: Analyzing trace with hash -356831903, now seen corresponding path program 1165 times [2020-02-10 20:23:21,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,244 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23645856] [2020-02-10 20:23:21,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:21,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:21,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23645856] [2020-02-10 20:23:21,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:21,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:21,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191833001] [2020-02-10 20:23:21,611 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:21,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:21,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:21,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:21,612 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:23:21,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:21,757 INFO L93 Difference]: Finished difference Result 1209 states and 4266 transitions. [2020-02-10 20:23:21,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:21,758 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:21,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:21,761 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:23:21,761 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:21,761 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:21,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:21,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 779. [2020-02-10 20:23:21,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:21,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:23:21,783 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:23:21,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:21,783 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:23:21,783 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:23:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:21,784 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:21,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, 1, 1, 1] [2020-02-10 20:23:21,784 INFO L427 AbstractCegarLoop]: === Iteration 1173 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 644929023, now seen corresponding path program 1166 times [2020-02-10 20:23:21,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:21,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601585572] [2020-02-10 20:23:21,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,133 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601585572] [2020-02-10 20:23:22,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:22,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865096322] [2020-02-10 20:23:22,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:22,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:22,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:22,134 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:23:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:22,284 INFO L93 Difference]: Finished difference Result 1210 states and 4264 transitions. [2020-02-10 20:23:22,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:22,284 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:22,287 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:22,287 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:23:22,287 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:22,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:23:22,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 775. [2020-02-10 20:23:22,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:22,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:22,309 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:22,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:22,309 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:22,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:22,309 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:22,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:22,310 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:22,310 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:22,310 INFO L427 AbstractCegarLoop]: === Iteration 1174 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:22,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:22,310 INFO L82 PathProgramCache]: Analyzing trace with hash -799731043, now seen corresponding path program 1167 times [2020-02-10 20:23:22,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:22,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235455378] [2020-02-10 20:23:22,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:22,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:22,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:22,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [235455378] [2020-02-10 20:23:22,655 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:22,655 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:22,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817624631] [2020-02-10 20:23:22,655 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:22,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:22,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:22,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:22,655 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:22,789 INFO L93 Difference]: Finished difference Result 1204 states and 4252 transitions. [2020-02-10 20:23:22,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:22,789 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:22,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:22,793 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:22,793 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:22,793 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:22,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:22,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 777. [2020-02-10 20:23:22,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:22,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:22,814 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:22,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:22,814 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:22,814 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:22,815 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:22,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:22,815 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:22,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, 1, 1, 1] [2020-02-10 20:23:22,816 INFO L427 AbstractCegarLoop]: === Iteration 1175 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:22,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:22,816 INFO L82 PathProgramCache]: Analyzing trace with hash 223036091, now seen corresponding path program 1168 times [2020-02-10 20:23:22,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:22,816 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634610488] [2020-02-10 20:23:22,816 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:22,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:23,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634610488] [2020-02-10 20:23:23,157 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:23,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:23,157 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609020771] [2020-02-10 20:23:23,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:23,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:23,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:23,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:23,158 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:23,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,328 INFO L93 Difference]: Finished difference Result 1202 states and 4246 transitions. [2020-02-10 20:23:23,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:23,328 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:23,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,331 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:23:23,331 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:23:23,331 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:23:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 775. [2020-02-10 20:23:23,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:23:23,351 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:23:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,352 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:23:23,352 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:23:23,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:23,353 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,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, 1, 1, 1] [2020-02-10 20:23:23,354 INFO L427 AbstractCegarLoop]: === Iteration 1176 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,354 INFO L82 PathProgramCache]: Analyzing trace with hash -2009028191, now seen corresponding path program 1169 times [2020-02-10 20:23:23,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685566842] [2020-02-10 20:23:23,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:23,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:23,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685566842] [2020-02-10 20:23:23,707 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:23,707 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:23,707 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1595958716] [2020-02-10 20:23:23,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:23,707 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:23,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:23,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:23,708 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:23:23,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:23,847 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 20:23:23,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:23,847 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:23,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:23,850 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:23:23,851 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:23:23,851 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:23,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:23:23,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 20:23:23,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:23,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:23:23,873 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:23:23,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:23,873 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:23:23,873 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:23,873 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:23:23,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:23,874 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:23,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, 1, 1, 1] [2020-02-10 20:23:23,874 INFO L427 AbstractCegarLoop]: === Iteration 1177 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:23,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:23,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1212853725, now seen corresponding path program 1170 times [2020-02-10 20:23:23,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:23,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883507827] [2020-02-10 20:23:23,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883507827] [2020-02-10 20:23:24,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:24,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998846169] [2020-02-10 20:23:24,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:24,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:24,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:24,213 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:23:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,381 INFO L93 Difference]: Finished difference Result 1203 states and 4246 transitions. [2020-02-10 20:23:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:24,381 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,384 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:23:24,385 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:23:24,385 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:24,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:23:24,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 773. [2020-02-10 20:23:24,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:24,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:23:24,406 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:23:24,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,406 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:23:24,406 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:24,406 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:23:24,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:24,407 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,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, 1, 1, 1] [2020-02-10 20:23:24,407 INFO L427 AbstractCegarLoop]: === Iteration 1178 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,408 INFO L82 PathProgramCache]: Analyzing trace with hash 297371643, now seen corresponding path program 1171 times [2020-02-10 20:23:24,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616877890] [2020-02-10 20:23:24,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:24,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:24,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616877890] [2020-02-10 20:23:24,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:24,745 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:24,745 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488975543] [2020-02-10 20:23:24,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:24,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:24,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:24,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:24,746 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:23:24,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:24,906 INFO L93 Difference]: Finished difference Result 1220 states and 4288 transitions. [2020-02-10 20:23:24,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:24,906 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:24,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:24,909 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:24,909 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:23:24,909 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:24,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:23:24,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 780. [2020-02-10 20:23:24,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 20:23:24,930 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 20:23:24,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:24,930 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 20:23:24,930 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:24,930 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 20:23:24,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:24,931 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:24,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, 1, 1, 1] [2020-02-10 20:23:24,931 INFO L427 AbstractCegarLoop]: === Iteration 1179 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:24,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:24,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1908312601, now seen corresponding path program 1172 times [2020-02-10 20:23:24,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:24,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536665470] [2020-02-10 20:23:24,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:24,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536665470] [2020-02-10 20:23:25,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:25,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677556347] [2020-02-10 20:23:25,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:25,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:25,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:25,266 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:23:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:25,429 INFO L93 Difference]: Finished difference Result 1218 states and 4279 transitions. [2020-02-10 20:23:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:25,429 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:25,432 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:23:25,432 INFO L226 Difference]: Without dead ends: 1199 [2020-02-10 20:23:25,432 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:25,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2020-02-10 20:23:25,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 775. [2020-02-10 20:23:25,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:25,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:23:25,453 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:23:25,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:25,454 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:23:25,454 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:25,454 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:23:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:25,455 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:25,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, 1, 1, 1] [2020-02-10 20:23:25,455 INFO L427 AbstractCegarLoop]: === Iteration 1180 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:25,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:25,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1391463231, now seen corresponding path program 1173 times [2020-02-10 20:23:25,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:25,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631503298] [2020-02-10 20:23:25,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:25,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:25,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:25,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631503298] [2020-02-10 20:23:25,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:25,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:25,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532335676] [2020-02-10 20:23:25,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:25,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:25,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:25,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:25,784 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:23:25,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:25,917 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 20:23:25,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:25,918 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:25,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:25,921 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:23:25,921 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:23:25,921 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:23:25,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 777. [2020-02-10 20:23:25,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:25,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:23:25,942 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:23:25,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:25,942 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:23:25,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:23:25,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:25,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:25,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, 1, 1, 1] [2020-02-10 20:23:25,943 INFO L427 AbstractCegarLoop]: === Iteration 1181 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:25,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:25,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1929318809, now seen corresponding path program 1174 times [2020-02-10 20:23:25,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:25,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178791834] [2020-02-10 20:23:25,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:25,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:26,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:26,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178791834] [2020-02-10 20:23:26,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:26,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:26,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060522546] [2020-02-10 20:23:26,281 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:26,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:26,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:26,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:26,282 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:23:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,445 INFO L93 Difference]: Finished difference Result 1209 states and 4259 transitions. [2020-02-10 20:23:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:26,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:26,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,449 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:23:26,449 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:26,450 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:26,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 775. [2020-02-10 20:23:26,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:26,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:23:26,471 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:23:26,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,471 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:23:26,471 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:26,471 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:23:26,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:26,472 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,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, 1, 1, 1] [2020-02-10 20:23:26,472 INFO L427 AbstractCegarLoop]: === Iteration 1182 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1401966335, now seen corresponding path program 1175 times [2020-02-10 20:23:26,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041145275] [2020-02-10 20:23:26,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:26,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:26,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041145275] [2020-02-10 20:23:26,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:26,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:26,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257738654] [2020-02-10 20:23:26,815 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:26,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:26,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:26,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:26,815 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:23:26,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:26,948 INFO L93 Difference]: Finished difference Result 1210 states and 4261 transitions. [2020-02-10 20:23:26,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:26,948 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:26,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:26,951 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:26,952 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:26,952 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:26,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:26,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 777. [2020-02-10 20:23:26,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:23:26,973 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:26,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:26,973 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:23:26,973 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:26,973 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:23:26,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:26,974 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:26,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, 1, 1, 1] [2020-02-10 20:23:26,974 INFO L427 AbstractCegarLoop]: === Iteration 1183 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:26,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:26,975 INFO L82 PathProgramCache]: Analyzing trace with hash 328880955, now seen corresponding path program 1176 times [2020-02-10 20:23:26,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:26,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457639924] [2020-02-10 20:23:26,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:26,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:27,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 20:23:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457639924] [2020-02-10 20:23:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:27,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315678747] [2020-02-10 20:23:27,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:27,316 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:27,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:27,316 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:27,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:27,505 INFO L93 Difference]: Finished difference Result 1207 states and 4253 transitions. [2020-02-10 20:23:27,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:27,505 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:27,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:27,508 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:23:27,508 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:23:27,509 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:27,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:23:27,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 771. [2020-02-10 20:23:27,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:23:27,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 20:23:27,530 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 20:23:27,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:27,531 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 20:23:27,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:27,531 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 20:23:27,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:27,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:27,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, 1, 1, 1] [2020-02-10 20:23:27,532 INFO L427 AbstractCegarLoop]: === Iteration 1184 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:27,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:27,532 INFO L82 PathProgramCache]: Analyzing trace with hash 472498085, now seen corresponding path program 1177 times [2020-02-10 20:23:27,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:27,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547445669] [2020-02-10 20:23:27,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:27,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:27,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547445669] [2020-02-10 20:23:27,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:27,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:27,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932105320] [2020-02-10 20:23:27,896 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:27,897 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:27,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:27,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:27,897 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 20:23:28,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:28,033 INFO L93 Difference]: Finished difference Result 1241 states and 4353 transitions. [2020-02-10 20:23:28,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:28,034 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:28,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:28,037 INFO L225 Difference]: With dead ends: 1241 [2020-02-10 20:23:28,037 INFO L226 Difference]: Without dead ends: 1226 [2020-02-10 20:23:28,037 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:28,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2020-02-10 20:23:28,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 784. [2020-02-10 20:23:28,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 784 states. [2020-02-10 20:23:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 3114 transitions. [2020-02-10 20:23:28,059 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 3114 transitions. Word has length 25 [2020-02-10 20:23:28,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:28,059 INFO L479 AbstractCegarLoop]: Abstraction has 784 states and 3114 transitions. [2020-02-10 20:23:28,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:28,059 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 3114 transitions. [2020-02-10 20:23:28,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:28,060 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:28,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, 1, 1, 1] [2020-02-10 20:23:28,060 INFO L427 AbstractCegarLoop]: === Iteration 1185 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:28,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:28,061 INFO L82 PathProgramCache]: Analyzing trace with hash -600587295, now seen corresponding path program 1178 times [2020-02-10 20:23:28,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:28,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132656326] [2020-02-10 20:23:28,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:28,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:28,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:28,439 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132656326] [2020-02-10 20:23:28,439 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:28,439 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:28,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892554739] [2020-02-10 20:23:28,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:28,440 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:28,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:28,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:28,440 INFO L87 Difference]: Start difference. First operand 784 states and 3114 transitions. Second operand 10 states. [2020-02-10 20:23:28,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:28,595 INFO L93 Difference]: Finished difference Result 1242 states and 4349 transitions. [2020-02-10 20:23:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:28,595 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:28,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:28,598 INFO L225 Difference]: With dead ends: 1242 [2020-02-10 20:23:28,598 INFO L226 Difference]: Without dead ends: 1220 [2020-02-10 20:23:28,598 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:28,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2020-02-10 20:23:28,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 778. [2020-02-10 20:23:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:23:28,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:23:28,618 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:28,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:28,619 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:23:28,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:28,619 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:23:28,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:28,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:28,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, 1, 1, 1] [2020-02-10 20:23:28,620 INFO L427 AbstractCegarLoop]: === Iteration 1186 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:28,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:28,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1127939769, now seen corresponding path program 1179 times [2020-02-10 20:23:28,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:28,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480310999] [2020-02-10 20:23:28,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:28,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480310999] [2020-02-10 20:23:28,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:28,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:28,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481208930] [2020-02-10 20:23:28,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:28,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:28,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:28,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:28,995 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:29,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,132 INFO L93 Difference]: Finished difference Result 1238 states and 4341 transitions. [2020-02-10 20:23:29,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:29,132 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:29,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,136 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:23:29,136 INFO L226 Difference]: Without dead ends: 1223 [2020-02-10 20:23:29,136 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:29,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2020-02-10 20:23:29,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 783. [2020-02-10 20:23:29,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:23:29,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3107 transitions. [2020-02-10 20:23:29,157 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3107 transitions. Word has length 25 [2020-02-10 20:23:29,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,157 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3107 transitions. [2020-02-10 20:23:29,157 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:29,157 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3107 transitions. [2020-02-10 20:23:29,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:29,158 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,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, 1, 1, 1] [2020-02-10 20:23:29,158 INFO L427 AbstractCegarLoop]: === Iteration 1187 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,158 INFO L82 PathProgramCache]: Analyzing trace with hash -590084191, now seen corresponding path program 1180 times [2020-02-10 20:23:29,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95806341] [2020-02-10 20:23:29,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:29,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:29,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95806341] [2020-02-10 20:23:29,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:29,529 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:29,529 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450878679] [2020-02-10 20:23:29,529 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:29,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:29,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:29,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:29,529 INFO L87 Difference]: Start difference. First operand 783 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:23:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:29,671 INFO L93 Difference]: Finished difference Result 1237 states and 4334 transitions. [2020-02-10 20:23:29,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:29,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:29,674 INFO L225 Difference]: With dead ends: 1237 [2020-02-10 20:23:29,675 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:23:29,675 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:23:29,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 778. [2020-02-10 20:23:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:23:29,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3093 transitions. [2020-02-10 20:23:29,696 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3093 transitions. Word has length 25 [2020-02-10 20:23:29,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:29,696 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3093 transitions. [2020-02-10 20:23:29,696 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:29,696 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3093 transitions. [2020-02-10 20:23:29,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:29,697 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:29,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, 1, 1, 1] [2020-02-10 20:23:29,697 INFO L427 AbstractCegarLoop]: === Iteration 1188 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:29,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:29,697 INFO L82 PathProgramCache]: Analyzing trace with hash -1106933561, now seen corresponding path program 1181 times [2020-02-10 20:23:29,697 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:29,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323235774] [2020-02-10 20:23:29,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:30,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 20:23:30,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323235774] [2020-02-10 20:23:30,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:30,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:30,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439871419] [2020-02-10 20:23:30,066 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:30,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:30,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:30,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:30,067 INFO L87 Difference]: Start difference. First operand 778 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:23:30,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,221 INFO L93 Difference]: Finished difference Result 1240 states and 4340 transitions. [2020-02-10 20:23:30,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:30,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:30,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,224 INFO L225 Difference]: With dead ends: 1240 [2020-02-10 20:23:30,225 INFO L226 Difference]: Without dead ends: 1224 [2020-02-10 20:23:30,225 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:30,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2020-02-10 20:23:30,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 783. [2020-02-10 20:23:30,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:23:30,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3102 transitions. [2020-02-10 20:23:30,246 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3102 transitions. Word has length 25 [2020-02-10 20:23:30,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,246 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3102 transitions. [2020-02-10 20:23:30,246 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:30,246 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3102 transitions. [2020-02-10 20:23:30,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:30,247 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,247 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:30,247 INFO L427 AbstractCegarLoop]: === Iteration 1189 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,248 INFO L82 PathProgramCache]: Analyzing trace with hash 504007397, now seen corresponding path program 1182 times [2020-02-10 20:23:30,248 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,248 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232653422] [2020-02-10 20:23:30,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:30,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:30,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232653422] [2020-02-10 20:23:30,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:30,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:30,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473134673] [2020-02-10 20:23:30,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:30,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:30,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:30,617 INFO L87 Difference]: Start difference. First operand 783 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:23:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:30,776 INFO L93 Difference]: Finished difference Result 1238 states and 4331 transitions. [2020-02-10 20:23:30,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:30,777 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:30,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:30,780 INFO L225 Difference]: With dead ends: 1238 [2020-02-10 20:23:30,780 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:23:30,781 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:30,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:23:30,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 773. [2020-02-10 20:23:30,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:30,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:23:30,802 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:23:30,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:30,803 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:23:30,803 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:30,803 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:23:30,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:30,804 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:30,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, 1, 1, 1] [2020-02-10 20:23:30,804 INFO L427 AbstractCegarLoop]: === Iteration 1190 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:30,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:30,805 INFO L82 PathProgramCache]: Analyzing trace with hash 29598945, now seen corresponding path program 1183 times [2020-02-10 20:23:30,805 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:30,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004344867] [2020-02-10 20:23:30,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:30,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:31,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004344867] [2020-02-10 20:23:31,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:31,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392612181] [2020-02-10 20:23:31,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:31,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:31,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:31,175 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:23:31,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,316 INFO L93 Difference]: Finished difference Result 1229 states and 4315 transitions. [2020-02-10 20:23:31,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:31,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:31,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,320 INFO L225 Difference]: With dead ends: 1229 [2020-02-10 20:23:31,320 INFO L226 Difference]: Without dead ends: 1214 [2020-02-10 20:23:31,320 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:31,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1214 states. [2020-02-10 20:23:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1214 to 781. [2020-02-10 20:23:31,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3100 transitions. [2020-02-10 20:23:31,341 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:31,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,342 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3100 transitions. [2020-02-10 20:23:31,342 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:31,342 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3100 transitions. [2020-02-10 20:23:31,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:31,343 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,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, 1, 1, 1] [2020-02-10 20:23:31,343 INFO L427 AbstractCegarLoop]: === Iteration 1191 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1043486435, now seen corresponding path program 1184 times [2020-02-10 20:23:31,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161707653] [2020-02-10 20:23:31,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:31,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161707653] [2020-02-10 20:23:31,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:31,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:31,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141375993] [2020-02-10 20:23:31,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:31,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:31,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:31,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:31,697 INFO L87 Difference]: Start difference. First operand 781 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:31,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:31,850 INFO L93 Difference]: Finished difference Result 1230 states and 4311 transitions. [2020-02-10 20:23:31,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:31,850 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:31,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:31,853 INFO L225 Difference]: With dead ends: 1230 [2020-02-10 20:23:31,854 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:23:31,854 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:23:31,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 775. [2020-02-10 20:23:31,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:31,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:23:31,875 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:23:31,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:31,875 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:23:31,875 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:23:31,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:31,876 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:31,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, 1, 1, 1] [2020-02-10 20:23:31,876 INFO L427 AbstractCegarLoop]: === Iteration 1192 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:31,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:31,876 INFO L82 PathProgramCache]: Analyzing trace with hash -476747321, now seen corresponding path program 1185 times [2020-02-10 20:23:31,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:31,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710266954] [2020-02-10 20:23:31,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:31,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,217 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,217 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710266954] [2020-02-10 20:23:32,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:32,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034532342] [2020-02-10 20:23:32,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:32,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:32,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:32,218 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:23:32,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:32,370 INFO L93 Difference]: Finished difference Result 1220 states and 4291 transitions. [2020-02-10 20:23:32,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:32,371 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:32,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:32,374 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:32,374 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:23:32,374 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:23:32,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 777. [2020-02-10 20:23:32,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:32,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:23:32,396 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:23:32,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:32,396 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:23:32,396 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:23:32,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:32,397 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:32,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, 1, 1, 1] [2020-02-10 20:23:32,397 INFO L427 AbstractCegarLoop]: === Iteration 1193 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:32,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:32,398 INFO L82 PathProgramCache]: Analyzing trace with hash -1011977123, now seen corresponding path program 1186 times [2020-02-10 20:23:32,398 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:32,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848844303] [2020-02-10 20:23:32,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:32,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:32,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848844303] [2020-02-10 20:23:32,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:32,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:32,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569804894] [2020-02-10 20:23:32,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:32,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:32,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:32,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:32,738 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:23:32,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:32,880 INFO L93 Difference]: Finished difference Result 1216 states and 4281 transitions. [2020-02-10 20:23:32,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:32,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:32,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:32,883 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:32,884 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:23:32,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:32,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:23:32,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 20:23:32,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:23:32,905 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:23:32,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:32,905 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:23:32,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:23:32,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:32,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:32,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:32,906 INFO L427 AbstractCegarLoop]: === Iteration 1194 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:32,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:32,907 INFO L82 PathProgramCache]: Analyzing trace with hash -455741113, now seen corresponding path program 1187 times [2020-02-10 20:23:32,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:32,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253120868] [2020-02-10 20:23:32,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:32,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253120868] [2020-02-10 20:23:33,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:33,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410565271] [2020-02-10 20:23:33,259 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:33,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:33,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:33,260 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:23:33,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,405 INFO L93 Difference]: Finished difference Result 1222 states and 4293 transitions. [2020-02-10 20:23:33,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:33,405 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:33,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,409 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:23:33,409 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:23:33,409 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:23:33,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 777. [2020-02-10 20:23:33,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:23:33,430 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:23:33,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,430 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:23:33,430 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:33,430 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:23:33,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:33,431 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,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, 1, 1, 1] [2020-02-10 20:23:33,431 INFO L427 AbstractCegarLoop]: === Iteration 1195 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,432 INFO L82 PathProgramCache]: Analyzing trace with hash 82114465, now seen corresponding path program 1188 times [2020-02-10 20:23:33,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202114168] [2020-02-10 20:23:33,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:33,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:33,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202114168] [2020-02-10 20:23:33,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:33,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:33,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783760153] [2020-02-10 20:23:33,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:33,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:33,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:33,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:33,793 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:23:33,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:33,952 INFO L93 Difference]: Finished difference Result 1217 states and 4281 transitions. [2020-02-10 20:23:33,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:33,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:33,956 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:23:33,956 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:33,956 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:33,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:33,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 773. [2020-02-10 20:23:33,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:33,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:23:33,977 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:23:33,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:33,978 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:23:33,978 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:33,978 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:23:33,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:33,979 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:33,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, 1, 1, 1] [2020-02-10 20:23:33,979 INFO L427 AbstractCegarLoop]: === Iteration 1196 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:33,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:33,979 INFO L82 PathProgramCache]: Analyzing trace with hash 355195169, now seen corresponding path program 1189 times [2020-02-10 20:23:33,979 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:33,979 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001235277] [2020-02-10 20:23:33,979 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001235277] [2020-02-10 20:23:34,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:34,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745049475] [2020-02-10 20:23:34,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:34,343 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:34,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:34,343 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:23:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:34,503 INFO L93 Difference]: Finished difference Result 1223 states and 4299 transitions. [2020-02-10 20:23:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:34,504 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:34,507 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:23:34,507 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:23:34,508 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:34,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:23:34,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 780. [2020-02-10 20:23:34,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:34,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3096 transitions. [2020-02-10 20:23:34,529 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3096 transitions. Word has length 25 [2020-02-10 20:23:34,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:34,529 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3096 transitions. [2020-02-10 20:23:34,530 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:34,530 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3096 transitions. [2020-02-10 20:23:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:34,531 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:34,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, 1, 1, 1] [2020-02-10 20:23:34,531 INFO L427 AbstractCegarLoop]: === Iteration 1197 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:34,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:34,531 INFO L82 PathProgramCache]: Analyzing trace with hash 893050747, now seen corresponding path program 1190 times [2020-02-10 20:23:34,531 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:34,531 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645677144] [2020-02-10 20:23:34,531 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:34,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:34,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:34,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645677144] [2020-02-10 20:23:34,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:34,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:34,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14749265] [2020-02-10 20:23:34,889 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:34,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:34,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:34,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:34,890 INFO L87 Difference]: Start difference. First operand 780 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:23:35,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,028 INFO L93 Difference]: Finished difference Result 1222 states and 4292 transitions. [2020-02-10 20:23:35,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:35,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:35,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,032 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:23:35,032 INFO L226 Difference]: Without dead ends: 1203 [2020-02-10 20:23:35,032 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:35,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2020-02-10 20:23:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 775. [2020-02-10 20:23:35,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:35,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:23:35,053 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:23:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,054 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:23:35,054 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:23:35,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:35,055 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,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, 1, 1, 1] [2020-02-10 20:23:35,055 INFO L427 AbstractCegarLoop]: === Iteration 1198 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1449286757, now seen corresponding path program 1191 times [2020-02-10 20:23:35,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746635200] [2020-02-10 20:23:35,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746635200] [2020-02-10 20:23:35,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:35,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922602538] [2020-02-10 20:23:35,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:35,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:35,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:35,402 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:23:35,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:35,538 INFO L93 Difference]: Finished difference Result 1217 states and 4282 transitions. [2020-02-10 20:23:35,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:35,539 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:35,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:35,542 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:23:35,542 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:35,542 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:35,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:23:35,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:35,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:23:35,577 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:23:35,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:35,577 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:23:35,577 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:35,577 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:23:35,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:35,578 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:35,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, 1, 1, 1] [2020-02-10 20:23:35,578 INFO L427 AbstractCegarLoop]: === Iteration 1199 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:35,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:35,578 INFO L82 PathProgramCache]: Analyzing trace with hash 914056955, now seen corresponding path program 1192 times [2020-02-10 20:23:35,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:35,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216096671] [2020-02-10 20:23:35,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:35,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:35,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216096671] [2020-02-10 20:23:35,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:35,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:35,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079331913] [2020-02-10 20:23:35,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:35,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:35,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:35,923 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:23:36,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:36,071 INFO L93 Difference]: Finished difference Result 1213 states and 4272 transitions. [2020-02-10 20:23:36,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:36,071 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:36,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:36,074 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:23:36,074 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:23:36,074 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:36,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:23:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 775. [2020-02-10 20:23:36,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:36,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:23:36,095 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:23:36,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:36,095 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:23:36,095 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:36,095 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:23:36,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:36,096 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:36,096 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:36,097 INFO L427 AbstractCegarLoop]: === Iteration 1200 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:36,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:36,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1480796069, now seen corresponding path program 1193 times [2020-02-10 20:23:36,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:36,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883024474] [2020-02-10 20:23:36,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:36,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23: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 20:23:36,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883024474] [2020-02-10 20:23:36,451 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,451 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:36,451 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351359119] [2020-02-10 20:23:36,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:36,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:36,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:36,452 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:23:36,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:36,602 INFO L93 Difference]: Finished difference Result 1215 states and 4276 transitions. [2020-02-10 20:23:36,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:36,602 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:36,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:36,606 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:23:36,606 INFO L226 Difference]: Without dead ends: 1201 [2020-02-10 20:23:36,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:36,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2020-02-10 20:23:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 777. [2020-02-10 20:23:36,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:36,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:23:36,627 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:36,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:36,627 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:23:36,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:36,627 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:23:36,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:36,629 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:36,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, 1, 1, 1] [2020-02-10 20:23:36,629 INFO L427 AbstractCegarLoop]: === Iteration 1201 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:36,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:36,629 INFO L82 PathProgramCache]: Analyzing trace with hash 407710689, now seen corresponding path program 1194 times [2020-02-10 20:23:36,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:36,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900953742] [2020-02-10 20:23:36,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:36,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 20:23:36,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900953742] [2020-02-10 20:23:36,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:36,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:36,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181724997] [2020-02-10 20:23:36,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:36,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:36,980 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:37,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,131 INFO L93 Difference]: Finished difference Result 1212 states and 4268 transitions. [2020-02-10 20:23:37,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:37,131 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:37,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,134 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:23:37,135 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:23:37,135 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:37,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:23:37,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 773. [2020-02-10 20:23:37,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:37,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:23:37,156 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:23:37,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,156 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:23:37,156 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:23:37,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:37,157 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,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, 1, 1, 1] [2020-02-10 20:23:37,158 INFO L427 AbstractCegarLoop]: === Iteration 1202 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,158 INFO L82 PathProgramCache]: Analyzing trace with hash -66697763, now seen corresponding path program 1195 times [2020-02-10 20:23:37,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,158 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679759882] [2020-02-10 20:23:37,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:37,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679759882] [2020-02-10 20:23:37,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:37,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:37,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803863864] [2020-02-10 20:23:37,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:37,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:37,509 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:23:37,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:37,678 INFO L93 Difference]: Finished difference Result 1226 states and 4303 transitions. [2020-02-10 20:23:37,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:37,678 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:37,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:37,681 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:23:37,682 INFO L226 Difference]: Without dead ends: 1210 [2020-02-10 20:23:37,682 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:37,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1210 states. [2020-02-10 20:23:37,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1210 to 780. [2020-02-10 20:23:37,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 20:23:37,703 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 20:23:37,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:37,703 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 20:23:37,703 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:37,704 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 20:23:37,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:37,705 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:37,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, 1, 1, 1] [2020-02-10 20:23:37,705 INFO L427 AbstractCegarLoop]: === Iteration 1203 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:37,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:37,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1544243195, now seen corresponding path program 1196 times [2020-02-10 20:23:37,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:37,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428397818] [2020-02-10 20:23:37,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428397818] [2020-02-10 20:23:38,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:38,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738684500] [2020-02-10 20:23:38,057 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:38,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:38,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:38,058 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:23:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,200 INFO L93 Difference]: Finished difference Result 1224 states and 4294 transitions. [2020-02-10 20:23:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:38,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,204 INFO L225 Difference]: With dead ends: 1224 [2020-02-10 20:23:38,204 INFO L226 Difference]: Without dead ends: 1205 [2020-02-10 20:23:38,204 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:38,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1205 states. [2020-02-10 20:23:38,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1205 to 775. [2020-02-10 20:23:38,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:38,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:23:38,226 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:23:38,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,226 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:23:38,226 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:38,226 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:23:38,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:38,227 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,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, 1, 1, 1] [2020-02-10 20:23:38,227 INFO L427 AbstractCegarLoop]: === Iteration 1204 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1027393825, now seen corresponding path program 1197 times [2020-02-10 20:23:38,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873085882] [2020-02-10 20:23:38,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:38,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:38,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873085882] [2020-02-10 20:23:38,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:38,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:38,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515580912] [2020-02-10 20:23:38,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:38,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:38,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:38,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:38,566 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:23:38,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:38,733 INFO L93 Difference]: Finished difference Result 1220 states and 4286 transitions. [2020-02-10 20:23:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:38,733 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:38,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:38,736 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:38,737 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:23:38,737 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:38,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:23:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 777. [2020-02-10 20:23:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:38,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:23:38,758 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:38,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:38,758 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:23:38,758 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:38,758 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:23:38,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:38,759 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:38,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, 1, 1, 1] [2020-02-10 20:23:38,759 INFO L427 AbstractCegarLoop]: === Iteration 1205 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:38,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1565249403, now seen corresponding path program 1198 times [2020-02-10 20:23:38,760 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:38,760 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331573594] [2020-02-10 20:23:38,760 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:39,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331573594] [2020-02-10 20:23:39,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:39,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249661034] [2020-02-10 20:23:39,097 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:39,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:39,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:39,097 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:39,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:39,267 INFO L93 Difference]: Finished difference Result 1215 states and 4274 transitions. [2020-02-10 20:23:39,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:39,267 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:39,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:39,270 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:23:39,271 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:39,271 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:39,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 775. [2020-02-10 20:23:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:39,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:23:39,292 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:23:39,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:39,292 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:23:39,292 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:23:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:39,293 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:39,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, 1, 1, 1] [2020-02-10 20:23:39,293 INFO L427 AbstractCegarLoop]: === Iteration 1206 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:39,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:39,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1037896929, now seen corresponding path program 1199 times [2020-02-10 20:23:39,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:39,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079257629] [2020-02-10 20:23:39,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:39,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 20:23:39,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079257629] [2020-02-10 20:23:39,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:39,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:39,649 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828405583] [2020-02-10 20:23:39,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:39,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:39,650 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:23:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:39,787 INFO L93 Difference]: Finished difference Result 1216 states and 4276 transitions. [2020-02-10 20:23:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:39,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:39,790 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:39,790 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:39,790 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:39,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 777. [2020-02-10 20:23:39,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:23:39,812 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:23:39,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:39,812 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:23:39,812 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:39,812 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:23:39,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:39,813 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:39,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, 1, 1, 1] [2020-02-10 20:23:39,813 INFO L427 AbstractCegarLoop]: === Iteration 1207 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:39,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:39,813 INFO L82 PathProgramCache]: Analyzing trace with hash -35188451, now seen corresponding path program 1200 times [2020-02-10 20:23:39,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:39,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362672805] [2020-02-10 20:23:39,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:39,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:40,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:40,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362672805] [2020-02-10 20:23:40,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:40,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:40,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163901755] [2020-02-10 20:23:40,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:40,168 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:40,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:40,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:40,168 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:23:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,331 INFO L93 Difference]: Finished difference Result 1213 states and 4268 transitions. [2020-02-10 20:23:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:40,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,335 INFO L225 Difference]: With dead ends: 1213 [2020-02-10 20:23:40,335 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:23:40,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:23:40,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 769. [2020-02-10 20:23:40,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:23:40,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3070 transitions. [2020-02-10 20:23:40,367 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3070 transitions. Word has length 25 [2020-02-10 20:23:40,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,367 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3070 transitions. [2020-02-10 20:23:40,367 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:40,367 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3070 transitions. [2020-02-10 20:23:40,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:40,368 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,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, 1, 1, 1] [2020-02-10 20:23:40,368 INFO L427 AbstractCegarLoop]: === Iteration 1208 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash 765261477, now seen corresponding path program 1201 times [2020-02-10 20:23:40,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200582012] [2020-02-10 20:23:40,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:40,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200582012] [2020-02-10 20:23:40,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:40,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:40,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150555523] [2020-02-10 20:23:40,734 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:40,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:40,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:40,734 INFO L87 Difference]: Start difference. First operand 769 states and 3070 transitions. Second operand 10 states. [2020-02-10 20:23:40,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:40,892 INFO L93 Difference]: Finished difference Result 1206 states and 4266 transitions. [2020-02-10 20:23:40,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:40,893 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:40,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:40,896 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:23:40,896 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:40,897 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:40,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:40,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 780. [2020-02-10 20:23:40,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:40,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3111 transitions. [2020-02-10 20:23:40,919 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3111 transitions. Word has length 25 [2020-02-10 20:23:40,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:40,919 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3111 transitions. [2020-02-10 20:23:40,919 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:40,919 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3111 transitions. [2020-02-10 20:23:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:40,920 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:40,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, 1, 1, 1] [2020-02-10 20:23:40,920 INFO L427 AbstractCegarLoop]: === Iteration 1209 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:40,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:40,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1746016195, now seen corresponding path program 1202 times [2020-02-10 20:23:40,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:40,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184899174] [2020-02-10 20:23:40,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:41,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184899174] [2020-02-10 20:23:41,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:41,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628473778] [2020-02-10 20:23:41,291 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:41,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:41,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:41,292 INFO L87 Difference]: Start difference. First operand 780 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:23:41,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:41,435 INFO L93 Difference]: Finished difference Result 1205 states and 4261 transitions. [2020-02-10 20:23:41,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:41,436 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:41,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:41,439 INFO L225 Difference]: With dead ends: 1205 [2020-02-10 20:23:41,439 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:23:41,439 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:23:41,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:23:41,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:41,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3103 transitions. [2020-02-10 20:23:41,460 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3103 transitions. Word has length 25 [2020-02-10 20:23:41,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:41,460 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3103 transitions. [2020-02-10 20:23:41,460 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:41,460 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3103 transitions. [2020-02-10 20:23:41,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:41,461 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:41,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, 1, 1, 1] [2020-02-10 20:23:41,461 INFO L427 AbstractCegarLoop]: === Iteration 1210 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:41,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:41,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1603671741, now seen corresponding path program 1203 times [2020-02-10 20:23:41,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:41,461 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757409824] [2020-02-10 20:23:41,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:41,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:41,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 20:23:41,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757409824] [2020-02-10 20:23:41,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:41,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:41,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287245323] [2020-02-10 20:23:41,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:41,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:41,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:41,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:41,827 INFO L87 Difference]: Start difference. First operand 777 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:23:41,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:41,977 INFO L93 Difference]: Finished difference Result 1211 states and 4274 transitions. [2020-02-10 20:23:41,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:41,978 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:41,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:41,981 INFO L225 Difference]: With dead ends: 1211 [2020-02-10 20:23:41,981 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:23:41,981 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:41,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:23:42,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 781. [2020-02-10 20:23:42,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3110 transitions. [2020-02-10 20:23:42,003 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3110 transitions. Word has length 25 [2020-02-10 20:23:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,003 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3110 transitions. [2020-02-10 20:23:42,003 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3110 transitions. [2020-02-10 20:23:42,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:42,004 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,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, 1, 1, 1] [2020-02-10 20:23:42,004 INFO L427 AbstractCegarLoop]: === Iteration 1211 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,004 INFO L82 PathProgramCache]: Analyzing trace with hash -612413919, now seen corresponding path program 1204 times [2020-02-10 20:23:42,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304834082] [2020-02-10 20:23:42,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:42,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:42,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304834082] [2020-02-10 20:23:42,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:42,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:42,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500162432] [2020-02-10 20:23:42,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:42,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:42,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:42,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:42,374 INFO L87 Difference]: Start difference. First operand 781 states and 3110 transitions. Second operand 10 states. [2020-02-10 20:23:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:42,537 INFO L93 Difference]: Finished difference Result 1214 states and 4276 transitions. [2020-02-10 20:23:42,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:42,537 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:42,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:42,540 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:23:42,541 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:23:42,541 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:42,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:23:42,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 777. [2020-02-10 20:23:42,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:42,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:23:42,562 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:42,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:42,562 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:23:42,562 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:42,562 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:23:42,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:42,563 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:42,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, 1, 1, 1] [2020-02-10 20:23:42,563 INFO L427 AbstractCegarLoop]: === Iteration 1212 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:42,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1884729691, now seen corresponding path program 1205 times [2020-02-10 20:23:42,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:42,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652937396] [2020-02-10 20:23:42,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:42,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:42,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 20:23:42,930 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652937396] [2020-02-10 20:23:42,930 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:42,930 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:42,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100578915] [2020-02-10 20:23:42,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:42,931 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:42,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:42,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:42,931 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:43,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,074 INFO L93 Difference]: Finished difference Result 1208 states and 4264 transitions. [2020-02-10 20:23:43,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:43,074 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:43,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,077 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:43,078 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:43,078 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:43,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:43,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:23:43,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:43,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3105 transitions. [2020-02-10 20:23:43,100 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3105 transitions. Word has length 25 [2020-02-10 20:23:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,100 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3105 transitions. [2020-02-10 20:23:43,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3105 transitions. [2020-02-10 20:23:43,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:43,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,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, 1, 1, 1] [2020-02-10 20:23:43,101 INFO L427 AbstractCegarLoop]: === Iteration 1213 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,101 INFO L82 PathProgramCache]: Analyzing trace with hash -273788733, now seen corresponding path program 1206 times [2020-02-10 20:23:43,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519289086] [2020-02-10 20:23:43,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,463 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519289086] [2020-02-10 20:23:43,463 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:43,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953277613] [2020-02-10 20:23:43,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:43,464 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:43,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:43,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:43,464 INFO L87 Difference]: Start difference. First operand 780 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:23:43,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:43,605 INFO L93 Difference]: Finished difference Result 1212 states and 4269 transitions. [2020-02-10 20:23:43,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:43,606 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:43,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:43,609 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:23:43,609 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:23:43,609 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:23:43,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 774. [2020-02-10 20:23:43,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:23:43,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3092 transitions. [2020-02-10 20:23:43,631 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:43,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:43,631 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3092 transitions. [2020-02-10 20:23:43,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3092 transitions. [2020-02-10 20:23:43,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:43,632 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:43,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, 1, 1, 1] [2020-02-10 20:23:43,632 INFO L427 AbstractCegarLoop]: === Iteration 1214 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:43,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:43,632 INFO L82 PathProgramCache]: Analyzing trace with hash 342775751, now seen corresponding path program 1207 times [2020-02-10 20:23:43,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:43,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927426109] [2020-02-10 20:23:43,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:43,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:43,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927426109] [2020-02-10 20:23:43,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:43,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:43,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566662508] [2020-02-10 20:23:43,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:44,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:44,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:44,000 INFO L87 Difference]: Start difference. First operand 774 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:23:44,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:44,152 INFO L93 Difference]: Finished difference Result 1204 states and 4259 transitions. [2020-02-10 20:23:44,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:44,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:44,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:44,156 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:44,156 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:44,156 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:44,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:44,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 780. [2020-02-10 20:23:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:44,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3108 transitions. [2020-02-10 20:23:44,179 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3108 transitions. Word has length 25 [2020-02-10 20:23:44,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:44,179 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3108 transitions. [2020-02-10 20:23:44,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:44,179 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3108 transitions. [2020-02-10 20:23:44,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:44,181 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:44,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, 1, 1, 1] [2020-02-10 20:23:44,181 INFO L427 AbstractCegarLoop]: === Iteration 1215 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash 1323530469, now seen corresponding path program 1208 times [2020-02-10 20:23:44,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:44,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784708706] [2020-02-10 20:23:44,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:44,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:44,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 20:23:44,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784708706] [2020-02-10 20:23:44,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:44,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:44,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688294090] [2020-02-10 20:23:44,562 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:44,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:44,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:44,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:44,563 INFO L87 Difference]: Start difference. First operand 780 states and 3108 transitions. Second operand 10 states. [2020-02-10 20:23:44,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:44,742 INFO L93 Difference]: Finished difference Result 1203 states and 4254 transitions. [2020-02-10 20:23:44,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:44,743 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:44,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:44,746 INFO L225 Difference]: With dead ends: 1203 [2020-02-10 20:23:44,746 INFO L226 Difference]: Without dead ends: 1188 [2020-02-10 20:23:44,746 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:44,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states. [2020-02-10 20:23:44,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 777. [2020-02-10 20:23:44,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3100 transitions. [2020-02-10 20:23:44,767 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:44,767 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3100 transitions. [2020-02-10 20:23:44,767 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3100 transitions. [2020-02-10 20:23:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:44,768 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:44,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, 1, 1, 1] [2020-02-10 20:23:44,768 INFO L427 AbstractCegarLoop]: === Iteration 1216 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:44,768 INFO L82 PathProgramCache]: Analyzing trace with hash -100123389, now seen corresponding path program 1209 times [2020-02-10 20:23:44,768 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:44,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176977285] [2020-02-10 20:23:44,769 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:45,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:45,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176977285] [2020-02-10 20:23:45,154 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:45,154 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:45,154 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119351154] [2020-02-10 20:23:45,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:45,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:45,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:45,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:45,155 INFO L87 Difference]: Start difference. First operand 777 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:45,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,331 INFO L93 Difference]: Finished difference Result 1207 states and 4263 transitions. [2020-02-10 20:23:45,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:45,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:45,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,334 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:23:45,334 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:23:45,334 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:45,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:23:45,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:23:45,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:23:45,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3107 transitions. [2020-02-10 20:23:45,355 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3107 transitions. Word has length 25 [2020-02-10 20:23:45,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,355 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3107 transitions. [2020-02-10 20:23:45,355 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:45,356 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3107 transitions. [2020-02-10 20:23:45,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:45,357 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,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, 1, 1, 1] [2020-02-10 20:23:45,357 INFO L427 AbstractCegarLoop]: === Iteration 1217 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,357 INFO L82 PathProgramCache]: Analyzing trace with hash 901637537, now seen corresponding path program 1210 times [2020-02-10 20:23:45,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502436975] [2020-02-10 20:23:45,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:45,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:45,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502436975] [2020-02-10 20:23:45,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:45,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:45,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956536587] [2020-02-10 20:23:45,729 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:45,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:45,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:45,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:45,729 INFO L87 Difference]: Start difference. First operand 781 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:23:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:45,912 INFO L93 Difference]: Finished difference Result 1208 states and 4261 transitions. [2020-02-10 20:23:45,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:45,912 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:45,916 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:45,916 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:23:45,916 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:45,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:23:45,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:23:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:45,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3097 transitions. [2020-02-10 20:23:45,937 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3097 transitions. Word has length 25 [2020-02-10 20:23:45,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:45,938 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3097 transitions. [2020-02-10 20:23:45,938 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:45,938 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3097 transitions. [2020-02-10 20:23:45,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:45,939 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:45,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, 1, 1, 1] [2020-02-10 20:23:45,939 INFO L427 AbstractCegarLoop]: === Iteration 1218 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash -1981619193, now seen corresponding path program 1211 times [2020-02-10 20:23:45,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:45,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335290450] [2020-02-10 20:23:45,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335290450] [2020-02-10 20:23:46,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:46,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167786020] [2020-02-10 20:23:46,308 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:46,308 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:46,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:46,308 INFO L87 Difference]: Start difference. First operand 777 states and 3097 transitions. Second operand 10 states. [2020-02-10 20:23:46,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:46,469 INFO L93 Difference]: Finished difference Result 1204 states and 4253 transitions. [2020-02-10 20:23:46,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:46,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:46,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:46,472 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:23:46,473 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:23:46,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:46,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:23:46,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 780. [2020-02-10 20:23:46,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:23:46,494 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:23:46,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:46,494 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:23:46,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:46,494 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:23:46,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:46,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:46,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, 1, 1, 1] [2020-02-10 20:23:46,495 INFO L427 AbstractCegarLoop]: === Iteration 1219 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:46,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:46,496 INFO L82 PathProgramCache]: Analyzing trace with hash 1240262723, now seen corresponding path program 1212 times [2020-02-10 20:23:46,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:46,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965013064] [2020-02-10 20:23:46,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:46,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:46,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965013064] [2020-02-10 20:23:46,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:46,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:46,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721509682] [2020-02-10 20:23:46,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:46,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:46,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:46,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:46,862 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:23:47,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,051 INFO L93 Difference]: Finished difference Result 1206 states and 4254 transitions. [2020-02-10 20:23:47,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:47,052 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,055 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:23:47,055 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:23:47,055 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:47,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:23:47,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 774. [2020-02-10 20:23:47,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:23:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3089 transitions. [2020-02-10 20:23:47,076 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:47,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,076 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3089 transitions. [2020-02-10 20:23:47,076 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:47,076 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3089 transitions. [2020-02-10 20:23:47,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:47,077 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,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, 1, 1, 1] [2020-02-10 20:23:47,077 INFO L427 AbstractCegarLoop]: === Iteration 1220 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,078 INFO L82 PathProgramCache]: Analyzing trace with hash 1846324103, now seen corresponding path program 1213 times [2020-02-10 20:23:47,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927927406] [2020-02-10 20:23:47,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:47,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:47,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927927406] [2020-02-10 20:23:47,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:47,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:47,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228545949] [2020-02-10 20:23:47,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:47,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:47,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:47,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:47,444 INFO L87 Difference]: Start difference. First operand 774 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:47,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:47,620 INFO L93 Difference]: Finished difference Result 1217 states and 4288 transitions. [2020-02-10 20:23:47,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:47,620 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:47,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:47,624 INFO L225 Difference]: With dead ends: 1217 [2020-02-10 20:23:47,624 INFO L226 Difference]: Without dead ends: 1204 [2020-02-10 20:23:47,624 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:47,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1204 states. [2020-02-10 20:23:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1204 to 782. [2020-02-10 20:23:47,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:23:47,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3111 transitions. [2020-02-10 20:23:47,645 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3111 transitions. Word has length 25 [2020-02-10 20:23:47,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:47,645 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3111 transitions. [2020-02-10 20:23:47,645 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:47,645 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3111 transitions. [2020-02-10 20:23:47,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:47,646 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:47,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, 1, 1, 1] [2020-02-10 20:23:47,646 INFO L427 AbstractCegarLoop]: === Iteration 1221 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:47,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:47,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1457385371, now seen corresponding path program 1214 times [2020-02-10 20:23:47,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:47,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289380786] [2020-02-10 20:23:47,647 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:48,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289380786] [2020-02-10 20:23:48,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:48,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642683301] [2020-02-10 20:23:48,010 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:48,010 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:48,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:48,010 INFO L87 Difference]: Start difference. First operand 782 states and 3111 transitions. Second operand 10 states. [2020-02-10 20:23:48,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,188 INFO L93 Difference]: Finished difference Result 1220 states and 4290 transitions. [2020-02-10 20:23:48,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:48,188 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:48,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,191 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:48,191 INFO L226 Difference]: Without dead ends: 1200 [2020-02-10 20:23:48,191 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:48,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2020-02-10 20:23:48,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 778. [2020-02-10 20:23:48,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:23:48,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3100 transitions. [2020-02-10 20:23:48,213 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:48,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,213 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3100 transitions. [2020-02-10 20:23:48,213 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:48,213 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3100 transitions. [2020-02-10 20:23:48,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:48,214 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,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, 1, 1, 1] [2020-02-10 20:23:48,214 INFO L427 AbstractCegarLoop]: === Iteration 1222 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,214 INFO L82 PathProgramCache]: Analyzing trace with hash -522609115, now seen corresponding path program 1215 times [2020-02-10 20:23:48,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,215 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573375221] [2020-02-10 20:23:48,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:48,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 20:23:48,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573375221] [2020-02-10 20:23:48,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:48,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:48,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420858425] [2020-02-10 20:23:48,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:48,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:48,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:48,579 INFO L87 Difference]: Start difference. First operand 778 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:48,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:48,722 INFO L93 Difference]: Finished difference Result 1215 states and 4280 transitions. [2020-02-10 20:23:48,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:48,722 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:48,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:48,725 INFO L225 Difference]: With dead ends: 1215 [2020-02-10 20:23:48,726 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:48,726 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:48,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:48,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 20:23:48,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:23:48,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3107 transitions. [2020-02-10 20:23:48,747 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3107 transitions. Word has length 25 [2020-02-10 20:23:48,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:48,747 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3107 transitions. [2020-02-10 20:23:48,747 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:48,747 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3107 transitions. [2020-02-10 20:23:48,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:48,748 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:48,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, 1, 1, 1] [2020-02-10 20:23:48,749 INFO L427 AbstractCegarLoop]: === Iteration 1223 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:48,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:48,749 INFO L82 PathProgramCache]: Analyzing trace with hash 479151811, now seen corresponding path program 1216 times [2020-02-10 20:23:48,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:48,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931866981] [2020-02-10 20:23:48,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:49,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:49,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931866981] [2020-02-10 20:23:49,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:49,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:49,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281975927] [2020-02-10 20:23:49,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:49,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:49,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:49,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:49,120 INFO L87 Difference]: Start difference. First operand 782 states and 3107 transitions. Second operand 10 states. [2020-02-10 20:23:49,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,306 INFO L93 Difference]: Finished difference Result 1216 states and 4278 transitions. [2020-02-10 20:23:49,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:49,306 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:49,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,310 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:49,310 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:23:49,310 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:49,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:23:49,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 778. [2020-02-10 20:23:49,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:23:49,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:23:49,331 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:23:49,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:49,331 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:23:49,331 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:49,331 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:23:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:49,332 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:49,332 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:49,332 INFO L427 AbstractCegarLoop]: === Iteration 1224 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:49,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:49,332 INFO L82 PathProgramCache]: Analyzing trace with hash -467567737, now seen corresponding path program 1217 times [2020-02-10 20:23:49,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:49,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623804219] [2020-02-10 20:23:49,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:49,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:49,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:49,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1623804219] [2020-02-10 20:23:49,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:49,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:49,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838180977] [2020-02-10 20:23:49,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:49,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:49,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:49,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:49,697 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:23:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:49,880 INFO L93 Difference]: Finished difference Result 1222 states and 4291 transitions. [2020-02-10 20:23:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:49,880 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:49,883 INFO L225 Difference]: With dead ends: 1222 [2020-02-10 20:23:49,883 INFO L226 Difference]: Without dead ends: 1206 [2020-02-10 20:23:49,884 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:49,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1206 states. [2020-02-10 20:23:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1206 to 783. [2020-02-10 20:23:49,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:23:49,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3105 transitions. [2020-02-10 20:23:49,905 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3105 transitions. Word has length 25 [2020-02-10 20:23:49,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:49,905 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3105 transitions. [2020-02-10 20:23:49,905 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:49,905 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3105 transitions. [2020-02-10 20:23:49,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:49,906 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:49,906 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:49,906 INFO L427 AbstractCegarLoop]: === Iteration 1225 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:49,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:49,906 INFO L82 PathProgramCache]: Analyzing trace with hash 1143373221, now seen corresponding path program 1218 times [2020-02-10 20:23:49,906 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:49,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835417429] [2020-02-10 20:23:49,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835417429] [2020-02-10 20:23:50,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:50,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955886434] [2020-02-10 20:23:50,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:50,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:50,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:50,280 INFO L87 Difference]: Start difference. First operand 783 states and 3105 transitions. Second operand 10 states. [2020-02-10 20:23:50,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:50,469 INFO L93 Difference]: Finished difference Result 1220 states and 4282 transitions. [2020-02-10 20:23:50,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:50,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:50,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:50,472 INFO L225 Difference]: With dead ends: 1220 [2020-02-10 20:23:50,472 INFO L226 Difference]: Without dead ends: 1197 [2020-02-10 20:23:50,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:50,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-02-10 20:23:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 774. [2020-02-10 20:23:50,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 774 states. [2020-02-10 20:23:50,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 774 states to 774 states and 3086 transitions. [2020-02-10 20:23:50,493 INFO L78 Accepts]: Start accepts. Automaton has 774 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:50,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:50,494 INFO L479 AbstractCegarLoop]: Abstraction has 774 states and 3086 transitions. [2020-02-10 20:23:50,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:50,494 INFO L276 IsEmpty]: Start isEmpty. Operand 774 states and 3086 transitions. [2020-02-10 20:23:50,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:50,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:50,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, 1, 1, 1] [2020-02-10 20:23:50,495 INFO L427 AbstractCegarLoop]: === Iteration 1226 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:50,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:50,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1265154109, now seen corresponding path program 1219 times [2020-02-10 20:23:50,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:50,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116084455] [2020-02-10 20:23:50,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:50,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:50,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116084455] [2020-02-10 20:23:50,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:50,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:50,843 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36184973] [2020-02-10 20:23:50,844 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:50,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:50,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:50,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:50,844 INFO L87 Difference]: Start difference. First operand 774 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:51,025 INFO L93 Difference]: Finished difference Result 1210 states and 4266 transitions. [2020-02-10 20:23:51,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:51,026 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:51,029 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:51,029 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:23:51,029 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:51,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:23:51,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 780. [2020-02-10 20:23:51,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:51,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3102 transitions. [2020-02-10 20:23:51,051 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3102 transitions. Word has length 25 [2020-02-10 20:23:51,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:51,051 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3102 transitions. [2020-02-10 20:23:51,051 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:51,051 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3102 transitions. [2020-02-10 20:23:51,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:51,052 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:51,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, 1, 1, 1] [2020-02-10 20:23:51,052 INFO L427 AbstractCegarLoop]: === Iteration 1227 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 345786849, now seen corresponding path program 1220 times [2020-02-10 20:23:51,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:51,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931101683] [2020-02-10 20:23:51,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931101683] [2020-02-10 20:23:51,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:51,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390076862] [2020-02-10 20:23:51,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:51,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:51,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:51,401 INFO L87 Difference]: Start difference. First operand 780 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:23:51,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:51,541 INFO L93 Difference]: Finished difference Result 1214 states and 4271 transitions. [2020-02-10 20:23:51,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:51,542 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:51,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:51,545 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:23:51,545 INFO L226 Difference]: Without dead ends: 1195 [2020-02-10 20:23:51,545 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-02-10 20:23:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 777. [2020-02-10 20:23:51,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:23:51,567 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:23:51,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:51,567 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:23:51,567 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:51,567 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:23:51,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:51,568 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:51,568 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:51,568 INFO L427 AbstractCegarLoop]: === Iteration 1228 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:51,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:51,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1429375333, now seen corresponding path program 1221 times [2020-02-10 20:23:51,569 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:51,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514036275] [2020-02-10 20:23:51,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:51,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:51,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514036275] [2020-02-10 20:23:51,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:51,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:51,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58587499] [2020-02-10 20:23:51,926 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:51,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:51,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:51,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:51,927 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:23:52,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,088 INFO L93 Difference]: Finished difference Result 1208 states and 4259 transitions. [2020-02-10 20:23:52,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:52,089 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:52,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,092 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:23:52,092 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:23:52,092 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:52,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:23:52,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 780. [2020-02-10 20:23:52,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:52,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3099 transitions. [2020-02-10 20:23:52,114 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3099 transitions. Word has length 25 [2020-02-10 20:23:52,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,114 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3099 transitions. [2020-02-10 20:23:52,114 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:52,114 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3099 transitions. [2020-02-10 20:23:52,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:52,115 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,115 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:52,115 INFO L427 AbstractCegarLoop]: === Iteration 1229 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,115 INFO L82 PathProgramCache]: Analyzing trace with hash 356289953, now seen corresponding path program 1222 times [2020-02-10 20:23:52,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130381370] [2020-02-10 20:23:52,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:52,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:52,471 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130381370] [2020-02-10 20:23:52,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:52,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:52,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974440118] [2020-02-10 20:23:52,471 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:52,471 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:52,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:52,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:52,471 INFO L87 Difference]: Start difference. First operand 780 states and 3099 transitions. Second operand 10 states. [2020-02-10 20:23:52,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:52,654 INFO L93 Difference]: Finished difference Result 1210 states and 4260 transitions. [2020-02-10 20:23:52,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:52,654 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:52,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:52,658 INFO L225 Difference]: With dead ends: 1210 [2020-02-10 20:23:52,658 INFO L226 Difference]: Without dead ends: 1193 [2020-02-10 20:23:52,658 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:52,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1193 states. [2020-02-10 20:23:52,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1193 to 777. [2020-02-10 20:23:52,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 20:23:52,680 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 20:23:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:52,680 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 20:23:52,680 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 20:23:52,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:52,681 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:52,681 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:52,681 INFO L427 AbstractCegarLoop]: === Iteration 1230 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:52,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:52,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1439878437, now seen corresponding path program 1223 times [2020-02-10 20:23:52,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:52,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267988840] [2020-02-10 20:23:52,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:52,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,045 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267988840] [2020-02-10 20:23:53,045 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,045 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:53,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236165219] [2020-02-10 20:23:53,046 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:53,046 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:53,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:53,046 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:23:53,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,195 INFO L93 Difference]: Finished difference Result 1218 states and 4278 transitions. [2020-02-10 20:23:53,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:53,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,198 INFO L225 Difference]: With dead ends: 1218 [2020-02-10 20:23:53,198 INFO L226 Difference]: Without dead ends: 1202 [2020-02-10 20:23:53,198 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:53,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1202 states. [2020-02-10 20:23:53,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1202 to 782. [2020-02-10 20:23:53,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:23:53,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 20:23:53,219 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 20:23:53,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,220 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 20:23:53,220 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:53,220 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 20:23:53,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:53,221 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,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, 1, 1, 1] [2020-02-10 20:23:53,221 INFO L427 AbstractCegarLoop]: === Iteration 1231 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,221 INFO L82 PathProgramCache]: Analyzing trace with hash -1244147901, now seen corresponding path program 1224 times [2020-02-10 20:23:53,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248288108] [2020-02-10 20:23:53,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:53,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:53,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248288108] [2020-02-10 20:23:53,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:53,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:53,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925783324] [2020-02-10 20:23:53,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:53,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:53,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:53,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:53,582 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:23:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:53,768 INFO L93 Difference]: Finished difference Result 1216 states and 4269 transitions. [2020-02-10 20:23:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:53,768 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:53,771 INFO L225 Difference]: With dead ends: 1216 [2020-02-10 20:23:53,772 INFO L226 Difference]: Without dead ends: 1191 [2020-02-10 20:23:53,772 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:53,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states. [2020-02-10 20:23:53,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 771. [2020-02-10 20:23:53,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:23:53,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3079 transitions. [2020-02-10 20:23:53,793 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3079 transitions. Word has length 25 [2020-02-10 20:23:53,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:53,793 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3079 transitions. [2020-02-10 20:23:53,793 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:53,793 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3079 transitions. [2020-02-10 20:23:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:53,794 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:53,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, 1, 1, 1] [2020-02-10 20:23:53,794 INFO L427 AbstractCegarLoop]: === Iteration 1232 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:53,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:53,794 INFO L82 PathProgramCache]: Analyzing trace with hash 340950241, now seen corresponding path program 1225 times [2020-02-10 20:23:53,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:53,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321731452] [2020-02-10 20:23:53,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:53,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321731452] [2020-02-10 20:23:54,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:54,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141781546] [2020-02-10 20:23:54,174 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:54,175 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:54,175 INFO L87 Difference]: Start difference. First operand 771 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:23:54,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:54,336 INFO L93 Difference]: Finished difference Result 1192 states and 4219 transitions. [2020-02-10 20:23:54,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:54,336 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:54,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:54,339 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:23:54,339 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:23:54,339 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:23:54,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 779. [2020-02-10 20:23:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:54,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3104 transitions. [2020-02-10 20:23:54,360 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3104 transitions. Word has length 25 [2020-02-10 20:23:54,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:54,360 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3104 transitions. [2020-02-10 20:23:54,360 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:54,360 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3104 transitions. [2020-02-10 20:23:54,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:54,361 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:54,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, 1, 1, 1] [2020-02-10 20:23:54,362 INFO L427 AbstractCegarLoop]: === Iteration 1233 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:54,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:54,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1321704959, now seen corresponding path program 1226 times [2020-02-10 20:23:54,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:54,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463617678] [2020-02-10 20:23:54,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:54,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:54,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:54,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463617678] [2020-02-10 20:23:54,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:54,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:54,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400907898] [2020-02-10 20:23:54,738 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:54,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:54,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:54,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:54,738 INFO L87 Difference]: Start difference. First operand 779 states and 3104 transitions. Second operand 10 states. [2020-02-10 20:23:54,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:54,923 INFO L93 Difference]: Finished difference Result 1191 states and 4214 transitions. [2020-02-10 20:23:54,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:54,924 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:54,927 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:23:54,927 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:23:54,927 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:54,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:23:54,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 776. [2020-02-10 20:23:54,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:23:54,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3096 transitions. [2020-02-10 20:23:54,963 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3096 transitions. Word has length 25 [2020-02-10 20:23:54,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:54,963 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3096 transitions. [2020-02-10 20:23:54,963 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:54,963 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3096 transitions. [2020-02-10 20:23:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:54,964 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:54,964 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:54,964 INFO L427 AbstractCegarLoop]: === Iteration 1234 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:54,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:54,964 INFO L82 PathProgramCache]: Analyzing trace with hash -2027982977, now seen corresponding path program 1227 times [2020-02-10 20:23:54,965 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:54,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462761078] [2020-02-10 20:23:54,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:55,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462761078] [2020-02-10 20:23:55,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:55,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:55,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373489967] [2020-02-10 20:23:55,329 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:55,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:55,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:55,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:55,329 INFO L87 Difference]: Start difference. First operand 776 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:23:55,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:55,509 INFO L93 Difference]: Finished difference Result 1197 states and 4227 transitions. [2020-02-10 20:23:55,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:55,510 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:55,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:55,513 INFO L225 Difference]: With dead ends: 1197 [2020-02-10 20:23:55,513 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:23:55,514 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:55,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:23:55,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 780. [2020-02-10 20:23:55,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:23:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3103 transitions. [2020-02-10 20:23:55,534 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3103 transitions. Word has length 25 [2020-02-10 20:23:55,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:55,535 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3103 transitions. [2020-02-10 20:23:55,535 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:55,535 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3103 transitions. [2020-02-10 20:23:55,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:55,536 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:55,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, 1, 1, 1] [2020-02-10 20:23:55,536 INFO L427 AbstractCegarLoop]: === Iteration 1235 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:55,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:55,536 INFO L82 PathProgramCache]: Analyzing trace with hash -1036725155, now seen corresponding path program 1228 times [2020-02-10 20:23:55,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:55,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4548146] [2020-02-10 20:23:55,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:55,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:55,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4548146] [2020-02-10 20:23:55,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:55,891 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:55,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705980825] [2020-02-10 20:23:55,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:55,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:55,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:55,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:55,892 INFO L87 Difference]: Start difference. First operand 780 states and 3103 transitions. Second operand 10 states. [2020-02-10 20:23:56,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:56,075 INFO L93 Difference]: Finished difference Result 1200 states and 4229 transitions. [2020-02-10 20:23:56,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:56,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:56,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:56,079 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:23:56,079 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:23:56,079 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:56,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:23:56,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 776. [2020-02-10 20:23:56,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:23:56,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3093 transitions. [2020-02-10 20:23:56,100 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3093 transitions. Word has length 25 [2020-02-10 20:23:56,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:56,100 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3093 transitions. [2020-02-10 20:23:56,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:56,100 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3093 transitions. [2020-02-10 20:23:56,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:56,101 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:56,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, 1, 1, 1] [2020-02-10 20:23:56,101 INFO L427 AbstractCegarLoop]: === Iteration 1236 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:56,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:56,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1985926369, now seen corresponding path program 1229 times [2020-02-10 20:23:56,101 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:56,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972604892] [2020-02-10 20:23:56,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:56,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:56,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:56,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972604892] [2020-02-10 20:23:56,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:56,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:56,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773797083] [2020-02-10 20:23:56,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:56,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:56,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:56,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:56,457 INFO L87 Difference]: Start difference. First operand 776 states and 3093 transitions. Second operand 10 states. [2020-02-10 20:23:56,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:56,637 INFO L93 Difference]: Finished difference Result 1194 states and 4217 transitions. [2020-02-10 20:23:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:56,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:56,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:56,640 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:23:56,641 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:23:56,641 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:56,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:23:56,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:23:56,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:23:56,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:23:56,662 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:56,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:56,662 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:23:56,662 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:56,662 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:23:56,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:56,663 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:56,663 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:56,663 INFO L427 AbstractCegarLoop]: === Iteration 1237 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:56,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:56,664 INFO L82 PathProgramCache]: Analyzing trace with hash -698099969, now seen corresponding path program 1230 times [2020-02-10 20:23:56,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:56,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350832035] [2020-02-10 20:23:56,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:56,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:57,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:57,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350832035] [2020-02-10 20:23:57,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:57,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:57,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927451511] [2020-02-10 20:23:57,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:57,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:57,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:57,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:57,023 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:57,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,155 INFO L93 Difference]: Finished difference Result 1198 states and 4222 transitions. [2020-02-10 20:23:57,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:57,155 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,158 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:23:57,158 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:23:57,158 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:23:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 773. [2020-02-10 20:23:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:23:57,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3086 transitions. [2020-02-10 20:23:57,179 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3086 transitions. Word has length 25 [2020-02-10 20:23:57,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,179 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3086 transitions. [2020-02-10 20:23:57,179 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:57,179 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3086 transitions. [2020-02-10 20:23:57,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:57,180 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,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, 1, 1, 1] [2020-02-10 20:23:57,180 INFO L427 AbstractCegarLoop]: === Iteration 1238 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,181 INFO L82 PathProgramCache]: Analyzing trace with hash -926506937, now seen corresponding path program 1231 times [2020-02-10 20:23:57,181 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,181 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833629939] [2020-02-10 20:23:57,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:57,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 20:23:57,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833629939] [2020-02-10 20:23:57,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:57,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:57,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904306325] [2020-02-10 20:23:57,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:57,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:57,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:57,561 INFO L87 Difference]: Start difference. First operand 773 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:23:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:57,688 INFO L93 Difference]: Finished difference Result 1183 states and 4194 transitions. [2020-02-10 20:23:57,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:57,688 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:57,691 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:23:57,692 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:23:57,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:23:57,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 20:23:57,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:23:57,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3098 transitions. [2020-02-10 20:23:57,714 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3098 transitions. Word has length 25 [2020-02-10 20:23:57,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:57,714 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3098 transitions. [2020-02-10 20:23:57,714 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:57,714 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3098 transitions. [2020-02-10 20:23:57,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:57,715 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:57,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, 1, 1, 1] [2020-02-10 20:23:57,715 INFO L427 AbstractCegarLoop]: === Iteration 1239 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 54247781, now seen corresponding path program 1232 times [2020-02-10 20:23:57,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:57,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743154173] [2020-02-10 20:23:57,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743154173] [2020-02-10 20:23:58,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:58,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227581715] [2020-02-10 20:23:58,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:58,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:58,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:58,099 INFO L87 Difference]: Start difference. First operand 778 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:23:58,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,229 INFO L93 Difference]: Finished difference Result 1182 states and 4189 transitions. [2020-02-10 20:23:58,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:58,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:58,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,233 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:23:58,233 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:23:58,233 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:58,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:23:58,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:23:58,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3091 transitions. [2020-02-10 20:23:58,254 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3091 transitions. Word has length 25 [2020-02-10 20:23:58,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:58,254 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3091 transitions. [2020-02-10 20:23:58,254 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:58,254 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3091 transitions. [2020-02-10 20:23:58,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:58,255 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:58,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, 1, 1, 1] [2020-02-10 20:23:58,255 INFO L427 AbstractCegarLoop]: === Iteration 1240 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:58,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:58,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1812305217, now seen corresponding path program 1233 times [2020-02-10 20:23:58,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:58,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516597905] [2020-02-10 20:23:58,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:58,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:58,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:58,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516597905] [2020-02-10 20:23:58,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:58,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:58,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967108092] [2020-02-10 20:23:58,626 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:58,626 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:58,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:58,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:58,627 INFO L87 Difference]: Start difference. First operand 775 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:23:58,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:58,771 INFO L93 Difference]: Finished difference Result 1181 states and 4187 transitions. [2020-02-10 20:23:58,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:58,771 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:58,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:58,775 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:23:58,775 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:23:58,775 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:58,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:23:58,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:23:58,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:58,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3094 transitions. [2020-02-10 20:23:58,796 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3094 transitions. Word has length 25 [2020-02-10 20:23:58,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:58,796 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3094 transitions. [2020-02-10 20:23:58,796 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:58,796 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3094 transitions. [2020-02-10 20:23:58,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:58,797 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:58,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, 1, 1, 1] [2020-02-10 20:23:58,797 INFO L427 AbstractCegarLoop]: === Iteration 1241 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:58,797 INFO L82 PathProgramCache]: Analyzing trace with hash -789538083, now seen corresponding path program 1234 times [2020-02-10 20:23:58,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:58,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453354731] [2020-02-10 20:23:58,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:58,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:59,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453354731] [2020-02-10 20:23:59,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:59,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925267083] [2020-02-10 20:23:59,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:59,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:59,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:59,169 INFO L87 Difference]: Start difference. First operand 777 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:23:59,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:59,304 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:23:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:59,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:59,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:59,307 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:23:59,307 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:23:59,307 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:59,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:23:59,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 775. [2020-02-10 20:23:59,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:23:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:23:59,328 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:23:59,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,328 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:23:59,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:59,328 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:23:59,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:59,329 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,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, 1, 1, 1] [2020-02-10 20:23:59,329 INFO L427 AbstractCegarLoop]: === Iteration 1242 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1695257863, now seen corresponding path program 1235 times [2020-02-10 20:23:59,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490516645] [2020-02-10 20:23:59,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:23:59,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:23:59,710 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490516645] [2020-02-10 20:23:59,710 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:23:59,710 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:23:59,710 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247444112] [2020-02-10 20:23:59,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:23:59,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:23:59,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:23:59,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:23:59,711 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:23:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:23:59,867 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:23:59,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:23:59,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:23:59,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:23:59,871 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:23:59,871 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:23:59,871 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:23:59,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:23:59,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 777. [2020-02-10 20:23:59,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:23:59,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:23:59,893 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:23:59,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:23:59,893 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:23:59,893 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:23:59,893 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:23:59,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:23:59,894 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:23:59,894 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:23:59,894 INFO L427 AbstractCegarLoop]: === Iteration 1243 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:23:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:23:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash -450912897, now seen corresponding path program 1236 times [2020-02-10 20:23:59,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:23:59,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314802999] [2020-02-10 20:23:59,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:23:59,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:00,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314802999] [2020-02-10 20:24:00,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:00,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998369679] [2020-02-10 20:24:00,267 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:00,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:00,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:00,267 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:00,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,398 INFO L93 Difference]: Finished difference Result 1178 states and 4177 transitions. [2020-02-10 20:24:00,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:00,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:00,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,401 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:24:00,402 INFO L226 Difference]: Without dead ends: 1163 [2020-02-10 20:24:00,402 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:00,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1163 states. [2020-02-10 20:24:00,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1163 to 773. [2020-02-10 20:24:00,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:00,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:24:00,423 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:24:00,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,423 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:24:00,423 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:00,423 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:24:00,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:00,424 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,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, 1, 1, 1] [2020-02-10 20:24:00,424 INFO L427 AbstractCegarLoop]: === Iteration 1244 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,425 INFO L82 PathProgramCache]: Analyzing trace with hash 577041415, now seen corresponding path program 1237 times [2020-02-10 20:24:00,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329351214] [2020-02-10 20:24:00,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:00,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 20:24:00,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329351214] [2020-02-10 20:24:00,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:00,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:00,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266903075] [2020-02-10 20:24:00,781 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:00,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:00,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:00,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:00,781 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:24:00,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:00,910 INFO L93 Difference]: Finished difference Result 1193 states and 4214 transitions. [2020-02-10 20:24:00,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:00,911 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:00,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:00,914 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:24:00,914 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:24:00,914 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:00,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:24:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 779. [2020-02-10 20:24:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:24:00,935 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:24:00,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:00,935 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:24:00,935 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:00,935 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:24:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:00,936 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:00,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, 1, 1, 1] [2020-02-10 20:24:00,936 INFO L427 AbstractCegarLoop]: === Iteration 1245 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:00,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:00,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1568299237, now seen corresponding path program 1238 times [2020-02-10 20:24:00,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:00,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762146629] [2020-02-10 20:24:00,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:00,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762146629] [2020-02-10 20:24:01,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:01,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378245147] [2020-02-10 20:24:01,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:01,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:01,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:01,298 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:24:01,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,426 INFO L93 Difference]: Finished difference Result 1196 states and 4216 transitions. [2020-02-10 20:24:01,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:01,426 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,430 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:24:01,430 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:01,430 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:01,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 775. [2020-02-10 20:24:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:01,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:24:01,451 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:24:01,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,451 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:24:01,451 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:01,451 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:24:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:01,452 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,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, 1, 1, 1] [2020-02-10 20:24:01,452 INFO L427 AbstractCegarLoop]: === Iteration 1246 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2060176353, now seen corresponding path program 1239 times [2020-02-10 20:24:01,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669663964] [2020-02-10 20:24:01,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:01,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669663964] [2020-02-10 20:24:01,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:01,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:01,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506019853] [2020-02-10 20:24:01,816 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:01,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:01,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:01,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:01,817 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:24:01,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:01,942 INFO L93 Difference]: Finished difference Result 1186 states and 4196 transitions. [2020-02-10 20:24:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:01,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:01,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:01,946 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:24:01,946 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:24:01,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:01,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:24:01,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 777. [2020-02-10 20:24:01,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:01,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:24:01,967 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:24:01,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:01,967 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:24:01,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:24:01,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:01,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:01,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:01,968 INFO L427 AbstractCegarLoop]: === Iteration 1247 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:01,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:01,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1212023809, now seen corresponding path program 1240 times [2020-02-10 20:24:01,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:01,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162431573] [2020-02-10 20:24:01,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:01,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,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 20:24:02,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162431573] [2020-02-10 20:24:02,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:02,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927817150] [2020-02-10 20:24:02,323 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:02,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:02,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:02,324 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:02,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:02,454 INFO L93 Difference]: Finished difference Result 1184 states and 4190 transitions. [2020-02-10 20:24:02,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:02,455 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:02,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:02,458 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:24:02,458 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:24:02,459 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:02,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:24:02,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:24:02,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:02,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:24:02,480 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:02,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:02,480 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:24:02,480 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:02,480 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:24:02,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:02,481 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:02,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, 1, 1, 1] [2020-02-10 20:24:02,481 INFO L427 AbstractCegarLoop]: === Iteration 1248 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:02,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:02,481 INFO L82 PathProgramCache]: Analyzing trace with hash -1085657977, now seen corresponding path program 1241 times [2020-02-10 20:24:02,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:02,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885752652] [2020-02-10 20:24:02,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:02,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:02,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:02,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885752652] [2020-02-10 20:24:02,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:02,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:02,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821439357] [2020-02-10 20:24:02,830 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:02,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:02,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:02,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:02,830 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:02,960 INFO L93 Difference]: Finished difference Result 1192 states and 4206 transitions. [2020-02-10 20:24:02,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:02,960 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:02,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:02,963 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:02,963 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:02,964 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:02,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:02,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:24:02,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:02,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:24:02,985 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:02,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:02,985 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:24:02,986 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:02,986 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:24:02,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:02,987 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:02,987 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:02,987 INFO L427 AbstractCegarLoop]: === Iteration 1249 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:02,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:02,987 INFO L82 PathProgramCache]: Analyzing trace with hash -547802399, now seen corresponding path program 1242 times [2020-02-10 20:24:02,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:02,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353402516] [2020-02-10 20:24:02,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:02,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353402516] [2020-02-10 20:24:03,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:03,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1598678861] [2020-02-10 20:24:03,335 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:03,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:03,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:03,336 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:03,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,471 INFO L93 Difference]: Finished difference Result 1187 states and 4194 transitions. [2020-02-10 20:24:03,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:03,472 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:03,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,475 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:24:03,475 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:24:03,475 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:03,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:24:03,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:24:03,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:03,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:24:03,495 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:24:03,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:03,496 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:24:03,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:03,496 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:24:03,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:03,497 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:03,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, 1, 1, 1] [2020-02-10 20:24:03,497 INFO L427 AbstractCegarLoop]: === Iteration 1250 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:03,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:03,497 INFO L82 PathProgramCache]: Analyzing trace with hash 1317631359, now seen corresponding path program 1243 times [2020-02-10 20:24:03,497 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:03,497 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592576776] [2020-02-10 20:24:03,497 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:03,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:03,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:03,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592576776] [2020-02-10 20:24:03,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:03,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:03,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980122449] [2020-02-10 20:24:03,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:03,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:03,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:03,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:03,855 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:24:03,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:03,985 INFO L93 Difference]: Finished difference Result 1188 states and 4200 transitions. [2020-02-10 20:24:03,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:03,986 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:03,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:03,989 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:03,989 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:03,989 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:04,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:04,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 778. [2020-02-10 20:24:04,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:24:04,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3094 transitions. [2020-02-10 20:24:04,011 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3094 transitions. Word has length 25 [2020-02-10 20:24:04,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,011 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3094 transitions. [2020-02-10 20:24:04,011 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:04,011 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3094 transitions. [2020-02-10 20:24:04,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:04,012 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,012 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:04,012 INFO L427 AbstractCegarLoop]: === Iteration 1251 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1366394979, now seen corresponding path program 1244 times [2020-02-10 20:24:04,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203321524] [2020-02-10 20:24:04,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:04,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:04,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203321524] [2020-02-10 20:24:04,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:04,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:04,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614926292] [2020-02-10 20:24:04,379 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:04,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:04,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:04,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:04,380 INFO L87 Difference]: Start difference. First operand 778 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:24:04,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:04,507 INFO L93 Difference]: Finished difference Result 1192 states and 4205 transitions. [2020-02-10 20:24:04,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:04,508 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:04,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:04,511 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:04,511 INFO L226 Difference]: Without dead ends: 1173 [2020-02-10 20:24:04,511 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:04,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1173 states. [2020-02-10 20:24:04,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1173 to 775. [2020-02-10 20:24:04,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:04,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:24:04,533 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:04,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:04,533 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:24:04,533 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:04,533 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:24:04,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:04,534 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:04,534 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:04,534 INFO L427 AbstractCegarLoop]: === Iteration 1252 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:04,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:04,534 INFO L82 PathProgramCache]: Analyzing trace with hash 811285093, now seen corresponding path program 1245 times [2020-02-10 20:24:04,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:04,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449597780] [2020-02-10 20:24:04,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:04,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:04,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449597780] [2020-02-10 20:24:04,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:04,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:04,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501708436] [2020-02-10 20:24:04,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:04,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:04,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:04,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:04,923 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:05,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:05,047 INFO L93 Difference]: Finished difference Result 1182 states and 4185 transitions. [2020-02-10 20:24:05,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:05,048 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:05,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:05,051 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:24:05,051 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:05,051 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:05,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:05,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:24:05,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:05,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:24:05,073 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:05,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:05,073 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:24:05,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:05,073 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:24:05,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:05,074 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:05,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, 1, 1, 1] [2020-02-10 20:24:05,074 INFO L427 AbstractCegarLoop]: === Iteration 1253 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:05,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:05,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1334885667, now seen corresponding path program 1246 times [2020-02-10 20:24:05,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:05,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904714103] [2020-02-10 20:24:05,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:05,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904714103] [2020-02-10 20:24:05,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:05,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143257064] [2020-02-10 20:24:05,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:05,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:05,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:05,441 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:05,575 INFO L93 Difference]: Finished difference Result 1181 states and 4181 transitions. [2020-02-10 20:24:05,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:05,576 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:05,579 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:24:05,579 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:05,579 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:05,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:05,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:24:05,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:05,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:05,600 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:05,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:05,601 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:05,601 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:05,601 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:05,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:05,602 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:05,602 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:05,602 INFO L427 AbstractCegarLoop]: === Iteration 1254 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:05,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:05,602 INFO L82 PathProgramCache]: Analyzing trace with hash 821788197, now seen corresponding path program 1247 times [2020-02-10 20:24:05,602 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:05,602 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868778953] [2020-02-10 20:24:05,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:05,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:05,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868778953] [2020-02-10 20:24:05,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:05,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:05,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122294368] [2020-02-10 20:24:05,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:05,962 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:05,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:05,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:05,963 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,084 INFO L93 Difference]: Finished difference Result 1190 states and 4199 transitions. [2020-02-10 20:24:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:06,085 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,088 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:24:06,088 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:24:06,088 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:24:06,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 777. [2020-02-10 20:24:06,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:06,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:06,110 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:06,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,110 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:06,110 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:06,110 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:06,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:06,111 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,111 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:06,111 INFO L427 AbstractCegarLoop]: === Iteration 1255 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1359643775, now seen corresponding path program 1248 times [2020-02-10 20:24:06,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483590172] [2020-02-10 20:24:06,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:06,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:06,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483590172] [2020-02-10 20:24:06,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:06,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:06,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889425317] [2020-02-10 20:24:06,466 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:06,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:06,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:06,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:06,467 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:06,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:06,612 INFO L93 Difference]: Finished difference Result 1185 states and 4187 transitions. [2020-02-10 20:24:06,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:06,613 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:06,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:06,616 INFO L225 Difference]: With dead ends: 1185 [2020-02-10 20:24:06,616 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:06,616 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:06,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:06,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 771. [2020-02-10 20:24:06,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:24:06,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3077 transitions. [2020-02-10 20:24:06,637 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3077 transitions. Word has length 25 [2020-02-10 20:24:06,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:06,638 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3077 transitions. [2020-02-10 20:24:06,638 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:06,638 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3077 transitions. [2020-02-10 20:24:06,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:06,639 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:06,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, 1, 1, 1] [2020-02-10 20:24:06,639 INFO L427 AbstractCegarLoop]: === Iteration 1256 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:06,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:06,639 INFO L82 PathProgramCache]: Analyzing trace with hash -293691103, now seen corresponding path program 1249 times [2020-02-10 20:24:06,639 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:06,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306489189] [2020-02-10 20:24:06,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:07,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306489189] [2020-02-10 20:24:07,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:07,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429138350] [2020-02-10 20:24:07,022 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:07,022 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:07,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:07,022 INFO L87 Difference]: Start difference. First operand 771 states and 3077 transitions. Second operand 10 states. [2020-02-10 20:24:07,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:07,156 INFO L93 Difference]: Finished difference Result 1188 states and 4209 transitions. [2020-02-10 20:24:07,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:07,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:07,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:07,159 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:07,160 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:24:07,160 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:07,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:24:07,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 779. [2020-02-10 20:24:07,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:07,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3102 transitions. [2020-02-10 20:24:07,181 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3102 transitions. Word has length 25 [2020-02-10 20:24:07,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:07,181 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3102 transitions. [2020-02-10 20:24:07,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3102 transitions. [2020-02-10 20:24:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:07,182 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:07,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, 1, 1, 1] [2020-02-10 20:24:07,182 INFO L427 AbstractCegarLoop]: === Iteration 1257 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:07,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:07,182 INFO L82 PathProgramCache]: Analyzing trace with hash 687063615, now seen corresponding path program 1250 times [2020-02-10 20:24:07,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:07,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859152251] [2020-02-10 20:24:07,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:07,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:07,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 20:24:07,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859152251] [2020-02-10 20:24:07,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:07,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:07,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110034167] [2020-02-10 20:24:07,561 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:07,561 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:07,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:07,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:07,561 INFO L87 Difference]: Start difference. First operand 779 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:24:07,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:07,689 INFO L93 Difference]: Finished difference Result 1187 states and 4204 transitions. [2020-02-10 20:24:07,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:07,689 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:07,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:07,692 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:24:07,692 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:24:07,692 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:24:07,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 776. [2020-02-10 20:24:07,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:24:07,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3094 transitions. [2020-02-10 20:24:07,713 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3094 transitions. Word has length 25 [2020-02-10 20:24:07,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:07,713 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3094 transitions. [2020-02-10 20:24:07,713 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:07,713 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3094 transitions. [2020-02-10 20:24:07,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:07,714 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:07,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, 1, 1, 1] [2020-02-10 20:24:07,715 INFO L427 AbstractCegarLoop]: === Iteration 1258 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:07,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:07,715 INFO L82 PathProgramCache]: Analyzing trace with hash -736590243, now seen corresponding path program 1251 times [2020-02-10 20:24:07,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:07,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355203397] [2020-02-10 20:24:07,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:07,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:08,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:08,098 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355203397] [2020-02-10 20:24:08,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:08,099 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:08,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679745] [2020-02-10 20:24:08,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:08,099 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:08,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:08,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:08,099 INFO L87 Difference]: Start difference. First operand 776 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:24:08,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,230 INFO L93 Difference]: Finished difference Result 1191 states and 4213 transitions. [2020-02-10 20:24:08,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:08,230 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:08,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,234 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:24:08,234 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:08,234 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:08,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:08,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 780. [2020-02-10 20:24:08,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:24:08,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3101 transitions. [2020-02-10 20:24:08,255 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3101 transitions. Word has length 25 [2020-02-10 20:24:08,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,256 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3101 transitions. [2020-02-10 20:24:08,256 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:08,256 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3101 transitions. [2020-02-10 20:24:08,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:08,257 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,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, 1, 1, 1] [2020-02-10 20:24:08,257 INFO L427 AbstractCegarLoop]: === Iteration 1259 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,257 INFO L82 PathProgramCache]: Analyzing trace with hash 265170683, now seen corresponding path program 1252 times [2020-02-10 20:24:08,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297563176] [2020-02-10 20:24:08,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:08,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297563176] [2020-02-10 20:24:08,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:08,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:08,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180327805] [2020-02-10 20:24:08,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:08,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:08,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:08,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:08,632 INFO L87 Difference]: Start difference. First operand 780 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:24:08,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:08,763 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 20:24:08,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:08,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:08,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:08,766 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:08,766 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:24:08,767 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:08,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:24:08,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 776. [2020-02-10 20:24:08,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:24:08,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3091 transitions. [2020-02-10 20:24:08,788 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3091 transitions. Word has length 25 [2020-02-10 20:24:08,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:08,789 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3091 transitions. [2020-02-10 20:24:08,789 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:08,789 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3091 transitions. [2020-02-10 20:24:08,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:08,790 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:08,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, 1, 1, 1] [2020-02-10 20:24:08,790 INFO L427 AbstractCegarLoop]: === Iteration 1260 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:08,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:08,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1676881249, now seen corresponding path program 1253 times [2020-02-10 20:24:08,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:08,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6069097] [2020-02-10 20:24:08,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6069097] [2020-02-10 20:24:09,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:09,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790223371] [2020-02-10 20:24:09,171 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:09,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:09,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:09,171 INFO L87 Difference]: Start difference. First operand 776 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:24:09,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:09,300 INFO L93 Difference]: Finished difference Result 1188 states and 4203 transitions. [2020-02-10 20:24:09,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:09,301 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:09,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:09,304 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:09,304 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:09,304 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:09,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:09,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 779. [2020-02-10 20:24:09,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:09,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:24:09,325 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:24:09,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:09,325 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:24:09,325 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:09,325 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:24:09,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:09,326 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:09,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, 1, 1, 1] [2020-02-10 20:24:09,327 INFO L427 AbstractCegarLoop]: === Iteration 1261 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:09,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:09,327 INFO L82 PathProgramCache]: Analyzing trace with hash 603795869, now seen corresponding path program 1254 times [2020-02-10 20:24:09,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:09,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430980326] [2020-02-10 20:24:09,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:09,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:09,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430980326] [2020-02-10 20:24:09,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:09,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:09,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570689421] [2020-02-10 20:24:09,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:09,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:09,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:09,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:09,719 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:24:09,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:09,852 INFO L93 Difference]: Finished difference Result 1190 states and 4204 transitions. [2020-02-10 20:24:09,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:09,852 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:09,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:09,855 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:24:09,856 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:09,856 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 773. [2020-02-10 20:24:09,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:09,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3084 transitions. [2020-02-10 20:24:09,877 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3084 transitions. Word has length 25 [2020-02-10 20:24:09,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:09,877 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3084 transitions. [2020-02-10 20:24:09,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:09,877 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3084 transitions. [2020-02-10 20:24:09,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:09,878 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:09,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, 1, 1, 1] [2020-02-10 20:24:09,878 INFO L427 AbstractCegarLoop]: === Iteration 1262 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:09,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:09,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1138662555, now seen corresponding path program 1255 times [2020-02-10 20:24:09,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:09,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713791956] [2020-02-10 20:24:09,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:10,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:10,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713791956] [2020-02-10 20:24:10,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:10,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:10,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844810923] [2020-02-10 20:24:10,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:10,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:10,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:10,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:10,263 INFO L87 Difference]: Start difference. First operand 773 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:24:10,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,397 INFO L93 Difference]: Finished difference Result 1181 states and 4188 transitions. [2020-02-10 20:24:10,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:10,398 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:10,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,401 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:24:10,401 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:10,401 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:10,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:10,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 778. [2020-02-10 20:24:10,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:24:10,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3096 transitions. [2020-02-10 20:24:10,423 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3096 transitions. Word has length 25 [2020-02-10 20:24:10,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,424 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3096 transitions. [2020-02-10 20:24:10,424 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:10,424 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3096 transitions. [2020-02-10 20:24:10,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:10,425 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,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, 1, 1, 1] [2020-02-10 20:24:10,425 INFO L427 AbstractCegarLoop]: === Iteration 1263 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,425 INFO L82 PathProgramCache]: Analyzing trace with hash -157907837, now seen corresponding path program 1256 times [2020-02-10 20:24:10,425 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771567075] [2020-02-10 20:24:10,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:10,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:10,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771567075] [2020-02-10 20:24:10,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:10,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:10,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362986400] [2020-02-10 20:24:10,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:10,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:10,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:10,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:10,809 INFO L87 Difference]: Start difference. First operand 778 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:24:10,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:10,942 INFO L93 Difference]: Finished difference Result 1180 states and 4183 transitions. [2020-02-10 20:24:10,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:10,942 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:10,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:10,946 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:24:10,946 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:24:10,946 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:10,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:24:10,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 775. [2020-02-10 20:24:10,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3089 transitions. [2020-02-10 20:24:10,967 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3089 transitions. Word has length 25 [2020-02-10 20:24:10,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:10,967 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3089 transitions. [2020-02-10 20:24:10,967 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:10,967 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3089 transitions. [2020-02-10 20:24:10,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:10,968 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:10,968 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:10,969 INFO L427 AbstractCegarLoop]: === Iteration 1264 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:10,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:10,969 INFO L82 PathProgramCache]: Analyzing trace with hash -2024460835, now seen corresponding path program 1257 times [2020-02-10 20:24:10,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:10,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611299798] [2020-02-10 20:24:10,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:10,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:11,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:11,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611299798] [2020-02-10 20:24:11,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:11,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910841742] [2020-02-10 20:24:11,337 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:11,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:11,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:11,337 INFO L87 Difference]: Start difference. First operand 775 states and 3089 transitions. Second operand 10 states. [2020-02-10 20:24:11,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:11,469 INFO L93 Difference]: Finished difference Result 1179 states and 4181 transitions. [2020-02-10 20:24:11,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:11,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:11,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:11,473 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:24:11,473 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:24:11,473 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:11,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:24:11,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:24:11,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:11,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3092 transitions. [2020-02-10 20:24:11,494 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3092 transitions. Word has length 25 [2020-02-10 20:24:11,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:11,494 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3092 transitions. [2020-02-10 20:24:11,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:11,495 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3092 transitions. [2020-02-10 20:24:11,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:11,496 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24: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, 1, 1, 1] [2020-02-10 20:24:11,496 INFO L427 AbstractCegarLoop]: === Iteration 1265 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:11,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:11,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1001693701, now seen corresponding path program 1258 times [2020-02-10 20:24:11,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:11,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992042569] [2020-02-10 20:24:11,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:11,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24: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 20:24:11,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992042569] [2020-02-10 20:24:11,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:11,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:11,875 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580338623] [2020-02-10 20:24:11,875 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:11,875 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:11,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:11,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:11,876 INFO L87 Difference]: Start difference. First operand 777 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:12,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,013 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:24:12,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:12,013 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:12,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,016 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:24:12,016 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:24:12,016 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:12,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:24:12,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:24:12,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:12,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:24:12,037 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:12,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,037 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:24:12,037 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:12,038 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:24:12,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:12,038 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,039 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:12,039 INFO L427 AbstractCegarLoop]: === Iteration 1266 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,039 INFO L82 PathProgramCache]: Analyzing trace with hash 1483102245, now seen corresponding path program 1259 times [2020-02-10 20:24:12,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685110999] [2020-02-10 20:24:12,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:12,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:12,425 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685110999] [2020-02-10 20:24:12,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:12,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:12,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781787412] [2020-02-10 20:24:12,425 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:12,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:12,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:12,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:12,426 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:12,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:12,559 INFO L93 Difference]: Finished difference Result 1177 states and 4175 transitions. [2020-02-10 20:24:12,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:12,559 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:12,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:12,562 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:24:12,562 INFO L226 Difference]: Without dead ends: 1165 [2020-02-10 20:24:12,563 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2020-02-10 20:24:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 777. [2020-02-10 20:24:12,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:12,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:24:12,584 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:12,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:12,584 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:24:12,584 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:12,584 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:24:12,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:12,585 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:12,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, 1, 1, 1] [2020-02-10 20:24:12,585 INFO L427 AbstractCegarLoop]: === Iteration 1267 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:12,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:12,585 INFO L82 PathProgramCache]: Analyzing trace with hash -663068515, now seen corresponding path program 1260 times [2020-02-10 20:24:12,585 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:12,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584577535] [2020-02-10 20:24:12,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:12,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:12,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584577535] [2020-02-10 20:24:12,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:12,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:12,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226313357] [2020-02-10 20:24:12,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:12,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:12,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:12,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:12,963 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,120 INFO L93 Difference]: Finished difference Result 1176 states and 4171 transitions. [2020-02-10 20:24:13,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:13,121 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,124 INFO L225 Difference]: With dead ends: 1176 [2020-02-10 20:24:13,124 INFO L226 Difference]: Without dead ends: 1161 [2020-02-10 20:24:13,124 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:13,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1161 states. [2020-02-10 20:24:13,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1161 to 773. [2020-02-10 20:24:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:13,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:24:13,145 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:24:13,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,145 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:24:13,145 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:13,145 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:24:13,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:13,146 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,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, 1, 1, 1] [2020-02-10 20:24:13,146 INFO L427 AbstractCegarLoop]: === Iteration 1268 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,147 INFO L82 PathProgramCache]: Analyzing trace with hash 1868434149, now seen corresponding path program 1261 times [2020-02-10 20:24:13,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655917430] [2020-02-10 20:24:13,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:13,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655917430] [2020-02-10 20:24:13,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:13,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:13,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28108030] [2020-02-10 20:24:13,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:13,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:13,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:13,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:13,525 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:24:13,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:13,662 INFO L93 Difference]: Finished difference Result 1187 states and 4200 transitions. [2020-02-10 20:24:13,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:13,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:13,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:13,665 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:24:13,665 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:24:13,666 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:24:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 779. [2020-02-10 20:24:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:13,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:24:13,686 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:24:13,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:13,686 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:24:13,687 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:13,687 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:24:13,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:13,688 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:13,688 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:13,688 INFO L427 AbstractCegarLoop]: === Iteration 1269 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:13,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:13,688 INFO L82 PathProgramCache]: Analyzing trace with hash -1424772221, now seen corresponding path program 1262 times [2020-02-10 20:24:13,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:13,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721465534] [2020-02-10 20:24:13,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721465534] [2020-02-10 20:24:14,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:14,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175954434] [2020-02-10 20:24:14,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:14,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:14,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:14,060 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:24:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:14,208 INFO L93 Difference]: Finished difference Result 1188 states and 4198 transitions. [2020-02-10 20:24:14,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:14,208 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:14,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:14,211 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:14,212 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:14,212 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:14,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:14,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:24:14,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:14,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:24:14,233 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:14,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:14,233 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:24:14,234 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:14,234 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:24:14,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:14,235 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:14,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, 1, 1, 1] [2020-02-10 20:24:14,235 INFO L427 AbstractCegarLoop]: === Iteration 1270 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:14,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:14,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1425535009, now seen corresponding path program 1263 times [2020-02-10 20:24:14,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:14,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318045412] [2020-02-10 20:24:14,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:14,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:14,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:14,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318045412] [2020-02-10 20:24:14,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:14,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:14,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013916275] [2020-02-10 20:24:14,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:14,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:14,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:14,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:14,610 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:14,782 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 20:24:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:14,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:14,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:14,785 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:24:14,786 INFO L226 Difference]: Without dead ends: 1169 [2020-02-10 20:24:14,786 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:14,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2020-02-10 20:24:14,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 777. [2020-02-10 20:24:14,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:14,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:24:14,807 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:14,807 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:24:14,807 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:24:14,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:14,808 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:14,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, 1, 1, 1] [2020-02-10 20:24:14,809 INFO L427 AbstractCegarLoop]: === Iteration 1271 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:14,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:14,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1846665153, now seen corresponding path program 1264 times [2020-02-10 20:24:14,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:14,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737880854] [2020-02-10 20:24:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737880854] [2020-02-10 20:24:15,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:15,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277256156] [2020-02-10 20:24:15,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:15,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:15,189 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:15,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,332 INFO L93 Difference]: Finished difference Result 1180 states and 4180 transitions. [2020-02-10 20:24:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:15,332 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,335 INFO L225 Difference]: With dead ends: 1180 [2020-02-10 20:24:15,335 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:24:15,336 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:24:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:24:15,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:15,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:15,356 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:15,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,357 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:15,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:15,357 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:15,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:15,358 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,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, 1, 1, 1] [2020-02-10 20:24:15,358 INFO L427 AbstractCegarLoop]: === Iteration 1272 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,358 INFO L82 PathProgramCache]: Analyzing trace with hash 216237861, now seen corresponding path program 1265 times [2020-02-10 20:24:15,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622578660] [2020-02-10 20:24:15,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:15,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:15,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622578660] [2020-02-10 20:24:15,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:15,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:15,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233779907] [2020-02-10 20:24:15,727 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:15,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:15,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:15,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:15,727 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:15,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:15,875 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 20:24:15,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:15,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:15,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:15,879 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:24:15,879 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:15,879 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:15,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:15,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:24:15,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:15,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:15,901 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:15,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:15,901 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:15,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:15,902 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:15,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, 1, 1, 1] [2020-02-10 20:24:15,902 INFO L427 AbstractCegarLoop]: === Iteration 1273 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:15,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash -856847519, now seen corresponding path program 1266 times [2020-02-10 20:24:15,902 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:15,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306384207] [2020-02-10 20:24:15,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:16,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306384207] [2020-02-10 20:24:16,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:16,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:16,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333840116] [2020-02-10 20:24:16,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:16,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:16,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:16,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:16,278 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:16,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,451 INFO L93 Difference]: Finished difference Result 1181 states and 4180 transitions. [2020-02-10 20:24:16,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:16,451 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:16,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,454 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:24:16,454 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:24:16,454 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:16,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:24:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 773. [2020-02-10 20:24:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:24:16,475 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:24:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:16,475 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:24:16,475 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:24:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:16,476 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:16,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, 1, 1, 1] [2020-02-10 20:24:16,476 INFO L427 AbstractCegarLoop]: === Iteration 1274 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:16,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:16,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1008586239, now seen corresponding path program 1267 times [2020-02-10 20:24:16,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:16,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538781937] [2020-02-10 20:24:16,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:16,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:16,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538781937] [2020-02-10 20:24:16,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:16,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:16,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312349077] [2020-02-10 20:24:16,848 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:16,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:16,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:16,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:16,848 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:24:16,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:16,988 INFO L93 Difference]: Finished difference Result 1182 states and 4186 transitions. [2020-02-10 20:24:16,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:16,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:16,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:16,991 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:24:16,992 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:16,992 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:17,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 778. [2020-02-10 20:24:17,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:24:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:24:17,013 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:24:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:17,013 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:24:17,013 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:24:17,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:17,014 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:17,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, 1, 1, 1] [2020-02-10 20:24:17,015 INFO L427 AbstractCegarLoop]: === Iteration 1275 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:17,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:17,015 INFO L82 PathProgramCache]: Analyzing trace with hash -64499141, now seen corresponding path program 1268 times [2020-02-10 20:24:17,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:17,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252323974] [2020-02-10 20:24:17,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252323974] [2020-02-10 20:24:17,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,389 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:17,389 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471219359] [2020-02-10 20:24:17,389 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:17,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:17,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:17,390 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:17,546 INFO L93 Difference]: Finished difference Result 1184 states and 4187 transitions. [2020-02-10 20:24:17,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:17,546 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:17,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:17,549 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:24:17,549 INFO L226 Difference]: Without dead ends: 1167 [2020-02-10 20:24:17,550 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1167 states. [2020-02-10 20:24:17,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1167 to 775. [2020-02-10 20:24:17,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:17,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:17,570 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:17,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:17,570 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:17,570 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:17,571 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:17,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:17,571 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:17,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, 1, 1, 1] [2020-02-10 20:24:17,572 INFO L427 AbstractCegarLoop]: === Iteration 1276 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:17,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:17,572 INFO L82 PathProgramCache]: Analyzing trace with hash 2102677827, now seen corresponding path program 1269 times [2020-02-10 20:24:17,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:17,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868159434] [2020-02-10 20:24:17,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:17,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:17,947 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868159434] [2020-02-10 20:24:17,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:17,947 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:17,947 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324414141] [2020-02-10 20:24:17,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:17,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:17,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:17,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:17,947 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:18,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,081 INFO L93 Difference]: Finished difference Result 1178 states and 4175 transitions. [2020-02-10 20:24:18,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:18,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:18,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,085 INFO L225 Difference]: With dead ends: 1178 [2020-02-10 20:24:18,085 INFO L226 Difference]: Without dead ends: 1166 [2020-02-10 20:24:18,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:18,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1166 states. [2020-02-10 20:24:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1166 to 777. [2020-02-10 20:24:18,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:18,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:18,107 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:18,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,107 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:18,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:18,107 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:18,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24: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, 1, 1, 1] [2020-02-10 20:24:18,108 INFO L427 AbstractCegarLoop]: === Iteration 1277 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,108 INFO L82 PathProgramCache]: Analyzing trace with hash -43492933, now seen corresponding path program 1270 times [2020-02-10 20:24:18,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238069034] [2020-02-10 20:24:18,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:18,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238069034] [2020-02-10 20:24:18,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:18,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:18,486 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677357129] [2020-02-10 20:24:18,486 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:18,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:18,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:18,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:18,486 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:18,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:18,628 INFO L93 Difference]: Finished difference Result 1177 states and 4171 transitions. [2020-02-10 20:24:18,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:18,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:18,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:18,632 INFO L225 Difference]: With dead ends: 1177 [2020-02-10 20:24:18,632 INFO L226 Difference]: Without dead ends: 1164 [2020-02-10 20:24:18,632 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:18,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2020-02-10 20:24:18,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 775. [2020-02-10 20:24:18,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:18,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:24:18,652 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:24:18,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:18,653 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:24:18,653 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:18,653 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:24:18,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:18,654 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:18,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, 1, 1, 1] [2020-02-10 20:24:18,654 INFO L427 AbstractCegarLoop]: === Iteration 1278 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:18,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:18,654 INFO L82 PathProgramCache]: Analyzing trace with hash 2123684035, now seen corresponding path program 1271 times [2020-02-10 20:24:18,654 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:18,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975605076] [2020-02-10 20:24:18,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:18,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:19,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975605076] [2020-02-10 20:24:19,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:19,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871880247] [2020-02-10 20:24:19,024 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:19,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:19,024 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:24:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,158 INFO L93 Difference]: Finished difference Result 1182 states and 4181 transitions. [2020-02-10 20:24:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:19,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,162 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:24:19,162 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:19,163 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:19,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 777. [2020-02-10 20:24:19,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:19,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:24:19,183 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:24:19,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,184 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:24:19,184 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:24:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:19,185 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,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, 1, 1, 1] [2020-02-10 20:24:19,185 INFO L427 AbstractCegarLoop]: === Iteration 1279 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1050598655, now seen corresponding path program 1272 times [2020-02-10 20:24:19,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190613915] [2020-02-10 20:24:19,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:19,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 20:24:19,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190613915] [2020-02-10 20:24:19,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:19,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:19,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227034128] [2020-02-10 20:24:19,579 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:19,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:19,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:19,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:19,580 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:24:19,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:19,734 INFO L93 Difference]: Finished difference Result 1179 states and 4173 transitions. [2020-02-10 20:24:19,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:19,735 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:19,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:19,738 INFO L225 Difference]: With dead ends: 1179 [2020-02-10 20:24:19,738 INFO L226 Difference]: Without dead ends: 1162 [2020-02-10 20:24:19,738 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:19,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-02-10 20:24:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 771. [2020-02-10 20:24:19,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:24:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3075 transitions. [2020-02-10 20:24:19,759 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3075 transitions. Word has length 25 [2020-02-10 20:24:19,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:19,759 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3075 transitions. [2020-02-10 20:24:19,759 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:19,760 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3075 transitions. [2020-02-10 20:24:19,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:19,760 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:19,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, 1, 1, 1] [2020-02-10 20:24:19,761 INFO L427 AbstractCegarLoop]: === Iteration 1280 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:19,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:19,761 INFO L82 PathProgramCache]: Analyzing trace with hash 997701631, now seen corresponding path program 1273 times [2020-02-10 20:24:19,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:19,761 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511113124] [2020-02-10 20:24:19,761 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:19,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,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 20:24:20,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511113124] [2020-02-10 20:24:20,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:20,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071885015] [2020-02-10 20:24:20,113 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:20,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:20,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:20,114 INFO L87 Difference]: Start difference. First operand 771 states and 3075 transitions. Second operand 10 states. [2020-02-10 20:24:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:20,269 INFO L93 Difference]: Finished difference Result 1209 states and 4260 transitions. [2020-02-10 20:24:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:20,270 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:20,273 INFO L225 Difference]: With dead ends: 1209 [2020-02-10 20:24:20,273 INFO L226 Difference]: Without dead ends: 1196 [2020-02-10 20:24:20,273 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:20,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2020-02-10 20:24:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 781. [2020-02-10 20:24:20,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:24:20,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3106 transitions. [2020-02-10 20:24:20,294 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3106 transitions. Word has length 25 [2020-02-10 20:24:20,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,294 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3106 transitions. [2020-02-10 20:24:20,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:20,294 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3106 transitions. [2020-02-10 20:24:20,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:20,295 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,295 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:20,295 INFO L427 AbstractCegarLoop]: === Iteration 1281 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1988959453, now seen corresponding path program 1274 times [2020-02-10 20:24:20,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558693274] [2020-02-10 20:24:20,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:20,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:20,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558693274] [2020-02-10 20:24:20,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:20,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:20,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450436042] [2020-02-10 20:24:20,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:20,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:20,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:20,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:20,646 INFO L87 Difference]: Start difference. First operand 781 states and 3106 transitions. Second operand 10 states. [2020-02-10 20:24:20,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:20,785 INFO L93 Difference]: Finished difference Result 1212 states and 4262 transitions. [2020-02-10 20:24:20,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:20,786 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:20,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:20,789 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:24:20,789 INFO L226 Difference]: Without dead ends: 1192 [2020-02-10 20:24:20,789 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:20,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1192 states. [2020-02-10 20:24:20,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1192 to 777. [2020-02-10 20:24:20,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3095 transitions. [2020-02-10 20:24:20,810 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3095 transitions. Word has length 25 [2020-02-10 20:24:20,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:20,811 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3095 transitions. [2020-02-10 20:24:20,811 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:20,811 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3095 transitions. [2020-02-10 20:24:20,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:20,812 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:20,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, 1, 1, 1] [2020-02-10 20:24:20,812 INFO L427 AbstractCegarLoop]: === Iteration 1282 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:20,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:20,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1371231587, now seen corresponding path program 1275 times [2020-02-10 20:24:20,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:20,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444479270] [2020-02-10 20:24:20,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:20,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:21,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:21,169 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444479270] [2020-02-10 20:24:21,169 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:21,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:21,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245191821] [2020-02-10 20:24:21,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:21,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:21,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:21,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:21,170 INFO L87 Difference]: Start difference. First operand 777 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:24:21,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,304 INFO L93 Difference]: Finished difference Result 1207 states and 4252 transitions. [2020-02-10 20:24:21,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:21,304 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:21,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,307 INFO L225 Difference]: With dead ends: 1207 [2020-02-10 20:24:21,308 INFO L226 Difference]: Without dead ends: 1194 [2020-02-10 20:24:21,308 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:21,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1194 states. [2020-02-10 20:24:21,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1194 to 781. [2020-02-10 20:24:21,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:24:21,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3102 transitions. [2020-02-10 20:24:21,329 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3102 transitions. Word has length 25 [2020-02-10 20:24:21,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,330 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3102 transitions. [2020-02-10 20:24:21,330 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:21,330 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3102 transitions. [2020-02-10 20:24:21,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:21,331 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:21,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, 1, 1, 1] [2020-02-10 20:24:21,331 INFO L427 AbstractCegarLoop]: === Iteration 1283 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash -369470661, now seen corresponding path program 1276 times [2020-02-10 20:24:21,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272561700] [2020-02-10 20:24:21,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:21,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 20:24:21,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272561700] [2020-02-10 20:24:21,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:21,687 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:21,687 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669704308] [2020-02-10 20:24:21,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:21,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:21,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:21,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:21,688 INFO L87 Difference]: Start difference. First operand 781 states and 3102 transitions. Second operand 10 states. [2020-02-10 20:24:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:21,823 INFO L93 Difference]: Finished difference Result 1208 states and 4250 transitions. [2020-02-10 20:24:21,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:21,824 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:21,827 INFO L225 Difference]: With dead ends: 1208 [2020-02-10 20:24:21,827 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:24:21,827 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:21,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:24:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 777. [2020-02-10 20:24:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3091 transitions. [2020-02-10 20:24:21,848 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3091 transitions. Word has length 25 [2020-02-10 20:24:21,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:21,848 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3091 transitions. [2020-02-10 20:24:21,848 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:21,848 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3091 transitions. [2020-02-10 20:24:21,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:21,849 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24: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, 1, 1, 1] [2020-02-10 20:24:21,849 INFO L427 AbstractCegarLoop]: === Iteration 1284 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:21,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -1316190209, now seen corresponding path program 1277 times [2020-02-10 20:24:21,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:21,850 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916062495] [2020-02-10 20:24:21,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:21,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916062495] [2020-02-10 20:24:22,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:22,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164176730] [2020-02-10 20:24:22,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:22,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:22,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:22,200 INFO L87 Difference]: Start difference. First operand 777 states and 3091 transitions. Second operand 10 states. [2020-02-10 20:24:22,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,333 INFO L93 Difference]: Finished difference Result 1214 states and 4263 transitions. [2020-02-10 20:24:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:22,333 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:22,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,337 INFO L225 Difference]: With dead ends: 1214 [2020-02-10 20:24:22,337 INFO L226 Difference]: Without dead ends: 1198 [2020-02-10 20:24:22,337 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:22,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1198 states. [2020-02-10 20:24:22,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1198 to 782. [2020-02-10 20:24:22,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2020-02-10 20:24:22,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 3100 transitions. [2020-02-10 20:24:22,358 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 3100 transitions. Word has length 25 [2020-02-10 20:24:22,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:22,358 INFO L479 AbstractCegarLoop]: Abstraction has 782 states and 3100 transitions. [2020-02-10 20:24:22,358 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:22,358 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 3100 transitions. [2020-02-10 20:24:22,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:22,359 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:22,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, 1, 1, 1] [2020-02-10 20:24:22,359 INFO L427 AbstractCegarLoop]: === Iteration 1285 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:22,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:22,359 INFO L82 PathProgramCache]: Analyzing trace with hash 294750749, now seen corresponding path program 1278 times [2020-02-10 20:24:22,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:22,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042825510] [2020-02-10 20:24:22,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:22,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:22,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:22,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042825510] [2020-02-10 20:24:22,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:22,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:22,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337049794] [2020-02-10 20:24:22,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:22,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:22,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:22,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:22,701 INFO L87 Difference]: Start difference. First operand 782 states and 3100 transitions. Second operand 10 states. [2020-02-10 20:24:22,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:22,867 INFO L93 Difference]: Finished difference Result 1212 states and 4254 transitions. [2020-02-10 20:24:22,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:22,867 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:22,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:22,870 INFO L225 Difference]: With dead ends: 1212 [2020-02-10 20:24:22,870 INFO L226 Difference]: Without dead ends: 1189 [2020-02-10 20:24:22,870 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:22,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1189 states. [2020-02-10 20:24:22,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1189 to 773. [2020-02-10 20:24:22,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:22,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3082 transitions. [2020-02-10 20:24:22,891 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3082 transitions. Word has length 25 [2020-02-10 20:24:22,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:22,891 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3082 transitions. [2020-02-10 20:24:22,891 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:22,891 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3082 transitions. [2020-02-10 20:24:22,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:22,892 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:22,892 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:22,892 INFO L427 AbstractCegarLoop]: === Iteration 1286 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:22,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:22,893 INFO L82 PathProgramCache]: Analyzing trace with hash 152730179, now seen corresponding path program 1279 times [2020-02-10 20:24:22,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:22,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661346165] [2020-02-10 20:24:22,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:22,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661346165] [2020-02-10 20:24:23,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:23,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773797806] [2020-02-10 20:24:23,233 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:23,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:23,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:23,234 INFO L87 Difference]: Start difference. First operand 773 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:24:23,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:23,378 INFO L93 Difference]: Finished difference Result 1199 states and 4229 transitions. [2020-02-10 20:24:23,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:23,378 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:23,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:23,381 INFO L225 Difference]: With dead ends: 1199 [2020-02-10 20:24:23,382 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:24:23,382 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:23,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:24:23,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 20:24:23,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:23,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3096 transitions. [2020-02-10 20:24:23,402 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3096 transitions. Word has length 25 [2020-02-10 20:24:23,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,403 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3096 transitions. [2020-02-10 20:24:23,403 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:23,403 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3096 transitions. [2020-02-10 20:24:23,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:23,404 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,404 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:23,404 INFO L427 AbstractCegarLoop]: === Iteration 1287 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1143988001, now seen corresponding path program 1280 times [2020-02-10 20:24:23,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727015320] [2020-02-10 20:24:23,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:23,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727015320] [2020-02-10 20:24:23,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:23,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:23,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207591370] [2020-02-10 20:24:23,743 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:23,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:23,743 INFO L87 Difference]: Start difference. First operand 779 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:24:23,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:23,875 INFO L93 Difference]: Finished difference Result 1202 states and 4231 transitions. [2020-02-10 20:24:23,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:23,875 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:23,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:23,878 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:24:23,878 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:23,878 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:23,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:23,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 20:24:23,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:23,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3087 transitions. [2020-02-10 20:24:23,899 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:23,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:23,899 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3087 transitions. [2020-02-10 20:24:23,899 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:23,899 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3087 transitions. [2020-02-10 20:24:23,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:23,900 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:23,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, 1, 1, 1] [2020-02-10 20:24:23,901 INFO L427 AbstractCegarLoop]: === Iteration 1288 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:23,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:23,901 INFO L82 PathProgramCache]: Analyzing trace with hash 1635865117, now seen corresponding path program 1281 times [2020-02-10 20:24:23,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:23,901 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593252559] [2020-02-10 20:24:23,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:23,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:24,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:24,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593252559] [2020-02-10 20:24:24,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:24,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:24,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227762830] [2020-02-10 20:24:24,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:24,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:24,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:24,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:24,247 INFO L87 Difference]: Start difference. First operand 775 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,395 INFO L93 Difference]: Finished difference Result 1192 states and 4211 transitions. [2020-02-10 20:24:24,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:24,395 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:24,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,398 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:24,399 INFO L226 Difference]: Without dead ends: 1179 [2020-02-10 20:24:24,399 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:24,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1179 states. [2020-02-10 20:24:24,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1179 to 777. [2020-02-10 20:24:24,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:24,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3090 transitions. [2020-02-10 20:24:24,421 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:24,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,421 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3090 transitions. [2020-02-10 20:24:24,421 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:24,421 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3090 transitions. [2020-02-10 20:24:24,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:24,422 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,422 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:24,422 INFO L427 AbstractCegarLoop]: === Iteration 1289 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,422 INFO L82 PathProgramCache]: Analyzing trace with hash -1636335045, now seen corresponding path program 1282 times [2020-02-10 20:24:24,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675078300] [2020-02-10 20:24:24,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:24,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:24,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675078300] [2020-02-10 20:24:24,779 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:24,779 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:24,779 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985656253] [2020-02-10 20:24:24,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:24,779 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:24,779 INFO L87 Difference]: Start difference. First operand 777 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:24,916 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 20:24:24,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:24,916 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:24,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:24,919 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:24:24,920 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:24:24,920 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:24:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 775. [2020-02-10 20:24:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:24,941 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:24,942 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:24,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:24,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:24,943 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:24,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, 1, 1, 1] [2020-02-10 20:24:24,943 INFO L427 AbstractCegarLoop]: === Iteration 1290 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:24,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:24,943 INFO L82 PathProgramCache]: Analyzing trace with hash -1509969213, now seen corresponding path program 1283 times [2020-02-10 20:24:24,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:24,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897335110] [2020-02-10 20:24:24,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:24,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,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 20:24:25,282 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897335110] [2020-02-10 20:24:25,282 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,282 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:25,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1569396985] [2020-02-10 20:24:25,282 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:25,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:25,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:25,283 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:25,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,413 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 20:24:25,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:25,414 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:25,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,417 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:24:25,417 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:25,417 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:25,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:25,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:24:25,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:25,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:25,438 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:25,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,439 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:25,439 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:25,439 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:25,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:25,440 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,440 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:25,440 INFO L427 AbstractCegarLoop]: === Iteration 1291 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,440 INFO L82 PathProgramCache]: Analyzing trace with hash -972113635, now seen corresponding path program 1284 times [2020-02-10 20:24:25,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160982425] [2020-02-10 20:24:25,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:25,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:25,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160982425] [2020-02-10 20:24:25,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:25,776 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:25,776 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808469892] [2020-02-10 20:24:25,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:25,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:25,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:25,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:25,777 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:25,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:25,933 INFO L93 Difference]: Finished difference Result 1193 states and 4209 transitions. [2020-02-10 20:24:25,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:25,933 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:25,937 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:24:25,937 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:25,937 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:25,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 773. [2020-02-10 20:24:25,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:25,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:24:25,959 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:24:25,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:25,959 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:24:25,959 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:25,959 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:24:25,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:25,960 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:25,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, 1, 1, 1] [2020-02-10 20:24:25,960 INFO L427 AbstractCegarLoop]: === Iteration 1292 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:25,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:25,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1656278531, now seen corresponding path program 1285 times [2020-02-10 20:24:25,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:25,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876153367] [2020-02-10 20:24:25,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24: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 20:24:26,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876153367] [2020-02-10 20:24:26,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:26,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608557058] [2020-02-10 20:24:26,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:26,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:26,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:26,306 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:24:26,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:26,469 INFO L93 Difference]: Finished difference Result 1195 states and 4219 transitions. [2020-02-10 20:24:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:26,469 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:26,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:26,472 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:24:26,472 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:26,472 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:26,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:26,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 779. [2020-02-10 20:24:26,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:26,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3094 transitions. [2020-02-10 20:24:26,493 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3094 transitions. Word has length 25 [2020-02-10 20:24:26,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:26,494 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3094 transitions. [2020-02-10 20:24:26,494 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:26,494 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3094 transitions. [2020-02-10 20:24:26,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:26,495 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:26,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, 1, 1, 1] [2020-02-10 20:24:26,495 INFO L427 AbstractCegarLoop]: === Iteration 1293 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:26,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:26,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1636927839, now seen corresponding path program 1286 times [2020-02-10 20:24:26,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:26,495 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655667863] [2020-02-10 20:24:26,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:26,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655667863] [2020-02-10 20:24:26,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:26,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:26,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236228159] [2020-02-10 20:24:26,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:26,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:26,846 INFO L87 Difference]: Start difference. First operand 779 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:24:26,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:26,983 INFO L93 Difference]: Finished difference Result 1196 states and 4217 transitions. [2020-02-10 20:24:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:26,984 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:26,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:26,987 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:24:26,987 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:26,987 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:26,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:27,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:24:27,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:27,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:27,008 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,008 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:27,008 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:27,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:27,009 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,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, 1, 1, 1] [2020-02-10 20:24:27,009 INFO L427 AbstractCegarLoop]: === Iteration 1294 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1213379391, now seen corresponding path program 1287 times [2020-02-10 20:24:27,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,010 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131027409] [2020-02-10 20:24:27,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:27,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:27,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131027409] [2020-02-10 20:24:27,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:27,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:27,358 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496610151] [2020-02-10 20:24:27,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:27,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:27,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:27,358 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:27,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:27,491 INFO L93 Difference]: Finished difference Result 1190 states and 4205 transitions. [2020-02-10 20:24:27,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:27,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:27,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:27,494 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:24:27,494 INFO L226 Difference]: Without dead ends: 1177 [2020-02-10 20:24:27,495 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:27,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177 states. [2020-02-10 20:24:27,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1177 to 777. [2020-02-10 20:24:27,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:27,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:27,516 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:27,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:27,516 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:27,516 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:27,516 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:27,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:27,517 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:27,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, 1, 1, 1] [2020-02-10 20:24:27,517 INFO L427 AbstractCegarLoop]: === Iteration 1295 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:27,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:27,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2058820771, now seen corresponding path program 1288 times [2020-02-10 20:24:27,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:27,518 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976176439] [2020-02-10 20:24:27,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:27,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:27,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976176439] [2020-02-10 20:24:27,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:27,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:27,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281396686] [2020-02-10 20:24:27,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:27,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:27,868 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:28,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,009 INFO L93 Difference]: Finished difference Result 1188 states and 4199 transitions. [2020-02-10 20:24:28,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:28,009 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:28,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,012 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:28,013 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:24:28,013 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:28,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:24:28,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:24:28,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:28,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:24:28,034 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:24:28,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,034 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:24:28,034 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:24:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:28,035 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,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, 1, 1, 1] [2020-02-10 20:24:28,035 INFO L427 AbstractCegarLoop]: === Iteration 1296 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,035 INFO L82 PathProgramCache]: Analyzing trace with hash 4082243, now seen corresponding path program 1289 times [2020-02-10 20:24:28,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384863988] [2020-02-10 20:24:28,036 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384863988] [2020-02-10 20:24:28,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:28,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814231419] [2020-02-10 20:24:28,381 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:28,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:28,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:28,381 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:24:28,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:28,514 INFO L93 Difference]: Finished difference Result 1192 states and 4207 transitions. [2020-02-10 20:24:28,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:28,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:28,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:28,517 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:28,517 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:28,518 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:28,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:28,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:24:28,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:24:28,539 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:24:28,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:28,539 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:24:28,539 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:28,539 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:24:28,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:28,540 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:28,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, 1, 1, 1] [2020-02-10 20:24:28,540 INFO L427 AbstractCegarLoop]: === Iteration 1297 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:28,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1069003137, now seen corresponding path program 1290 times [2020-02-10 20:24:28,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:28,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794071408] [2020-02-10 20:24:28,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:28,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:28,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:28,884 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794071408] [2020-02-10 20:24:28,884 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:28,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:28,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416451435] [2020-02-10 20:24:28,885 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:28,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:28,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:28,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:28,885 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:24:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,027 INFO L93 Difference]: Finished difference Result 1189 states and 4199 transitions. [2020-02-10 20:24:29,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:29,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,031 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:24:29,031 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:24:29,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:29,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:24:29,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 773. [2020-02-10 20:24:29,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:29,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:24:29,053 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:24:29,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:29,053 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:24:29,053 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:29,053 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:24:29,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:29,054 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:29,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, 1, 1, 1] [2020-02-10 20:24:29,054 INFO L427 AbstractCegarLoop]: === Iteration 1298 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:29,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:29,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1984485219, now seen corresponding path program 1291 times [2020-02-10 20:24:29,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:29,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975748342] [2020-02-10 20:24:29,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,407 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975748342] [2020-02-10 20:24:29,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:29,408 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471028689] [2020-02-10 20:24:29,408 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:29,408 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:29,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:29,408 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:24:29,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:29,550 INFO L93 Difference]: Finished difference Result 1206 states and 4241 transitions. [2020-02-10 20:24:29,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:29,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:29,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:29,554 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:24:29,554 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:24:29,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:29,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:24:29,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 780. [2020-02-10 20:24:29,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:24:29,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3094 transitions. [2020-02-10 20:24:29,575 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3094 transitions. Word has length 25 [2020-02-10 20:24:29,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:29,575 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3094 transitions. [2020-02-10 20:24:29,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:29,575 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3094 transitions. [2020-02-10 20:24:29,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:29,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:29,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, 1, 1, 1] [2020-02-10 20:24:29,576 INFO L427 AbstractCegarLoop]: === Iteration 1299 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:29,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:29,577 INFO L82 PathProgramCache]: Analyzing trace with hash -373544261, now seen corresponding path program 1292 times [2020-02-10 20:24:29,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:29,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810885985] [2020-02-10 20:24:29,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:29,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:29,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:29,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810885985] [2020-02-10 20:24:29,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:29,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:29,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048822387] [2020-02-10 20:24:29,915 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:29,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:29,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:29,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:29,915 INFO L87 Difference]: Start difference. First operand 780 states and 3094 transitions. Second operand 10 states. [2020-02-10 20:24:30,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,082 INFO L93 Difference]: Finished difference Result 1204 states and 4232 transitions. [2020-02-10 20:24:30,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:30,082 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:30,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,085 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:24:30,085 INFO L226 Difference]: Without dead ends: 1185 [2020-02-10 20:24:30,085 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:30,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1185 states. [2020-02-10 20:24:30,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1185 to 775. [2020-02-10 20:24:30,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:30,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:24:30,106 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:24:30,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,106 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:24:30,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:30,107 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:24:30,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:30,108 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,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, 1, 1, 1] [2020-02-10 20:24:30,108 INFO L427 AbstractCegarLoop]: === Iteration 1300 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,108 INFO L82 PathProgramCache]: Analyzing trace with hash -890393631, now seen corresponding path program 1293 times [2020-02-10 20:24:30,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036064023] [2020-02-10 20:24:30,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:30,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:30,437 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036064023] [2020-02-10 20:24:30,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:30,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:30,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670607119] [2020-02-10 20:24:30,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:30,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:30,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:30,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:30,438 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:24:30,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:30,592 INFO L93 Difference]: Finished difference Result 1200 states and 4224 transitions. [2020-02-10 20:24:30,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:30,593 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:30,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:30,596 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:24:30,596 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:24:30,596 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:30,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:24:30,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 777. [2020-02-10 20:24:30,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:30,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:24:30,618 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:24:30,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:30,618 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:24:30,619 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:30,619 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:24:30,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:30,620 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:30,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, 1, 1, 1] [2020-02-10 20:24:30,620 INFO L427 AbstractCegarLoop]: === Iteration 1301 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:30,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:30,620 INFO L82 PathProgramCache]: Analyzing trace with hash -352538053, now seen corresponding path program 1294 times [2020-02-10 20:24:30,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:30,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474620688] [2020-02-10 20:24:30,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:30,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:30,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:30,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474620688] [2020-02-10 20:24:30,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:30,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:30,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213981952] [2020-02-10 20:24:30,954 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:30,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:30,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:30,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:30,955 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:24:31,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,094 INFO L93 Difference]: Finished difference Result 1195 states and 4212 transitions. [2020-02-10 20:24:31,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:31,094 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:31,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,097 INFO L225 Difference]: With dead ends: 1195 [2020-02-10 20:24:31,098 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:31,098 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:31,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:31,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 775. [2020-02-10 20:24:31,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:24:31,118 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:24:31,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,119 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:24:31,119 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:31,119 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:24:31,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:31,120 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,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, 1, 1, 1] [2020-02-10 20:24:31,120 INFO L427 AbstractCegarLoop]: === Iteration 1302 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,120 INFO L82 PathProgramCache]: Analyzing trace with hash -879890527, now seen corresponding path program 1295 times [2020-02-10 20:24:31,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831261258] [2020-02-10 20:24:31,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:31,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831261258] [2020-02-10 20:24:31,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:31,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521532411] [2020-02-10 20:24:31,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:31,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:31,457 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:24:31,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:31,608 INFO L93 Difference]: Finished difference Result 1196 states and 4214 transitions. [2020-02-10 20:24:31,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:31,609 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:31,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:31,612 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:24:31,612 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:31,612 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:31,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 777. [2020-02-10 20:24:31,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:31,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:24:31,633 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:24:31,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:31,633 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:24:31,633 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:31,633 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:24:31,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:31,634 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:31,634 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:31,634 INFO L427 AbstractCegarLoop]: === Iteration 1303 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:31,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:31,634 INFO L82 PathProgramCache]: Analyzing trace with hash -1952975907, now seen corresponding path program 1296 times [2020-02-10 20:24:31,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:31,635 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525314000] [2020-02-10 20:24:31,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:31,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:31,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 20:24:31,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525314000] [2020-02-10 20:24:31,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:31,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:31,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875109436] [2020-02-10 20:24:31,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:31,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:31,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:31,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:31,971 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:24:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,108 INFO L93 Difference]: Finished difference Result 1193 states and 4206 transitions. [2020-02-10 20:24:32,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:32,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,112 INFO L225 Difference]: With dead ends: 1193 [2020-02-10 20:24:32,112 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:32,112 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:32,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 771. [2020-02-10 20:24:32,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 771 states. [2020-02-10 20:24:32,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 771 states to 771 states and 3073 transitions. [2020-02-10 20:24:32,133 INFO L78 Accepts]: Start accepts. Automaton has 771 states and 3073 transitions. Word has length 25 [2020-02-10 20:24:32,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:32,134 INFO L479 AbstractCegarLoop]: Abstraction has 771 states and 3073 transitions. [2020-02-10 20:24:32,134 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:32,134 INFO L276 IsEmpty]: Start isEmpty. Operand 771 states and 3073 transitions. [2020-02-10 20:24:32,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:32,135 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:32,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, 1, 1, 1] [2020-02-10 20:24:32,135 INFO L427 AbstractCegarLoop]: === Iteration 1304 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:32,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:32,135 INFO L82 PathProgramCache]: Analyzing trace with hash -507462939, now seen corresponding path program 1297 times [2020-02-10 20:24:32,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:32,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067207662] [2020-02-10 20:24:32,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:32,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067207662] [2020-02-10 20:24:32,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:32,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181398743] [2020-02-10 20:24:32,468 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:32,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:32,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:32,468 INFO L87 Difference]: Start difference. First operand 771 states and 3073 transitions. Second operand 10 states. [2020-02-10 20:24:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:32,602 INFO L93 Difference]: Finished difference Result 1198 states and 4227 transitions. [2020-02-10 20:24:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:32,603 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:32,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:32,606 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:24:32,606 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:24:32,606 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:32,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:24:32,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 779. [2020-02-10 20:24:32,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:32,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3098 transitions. [2020-02-10 20:24:32,627 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3098 transitions. Word has length 25 [2020-02-10 20:24:32,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:32,627 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3098 transitions. [2020-02-10 20:24:32,627 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3098 transitions. [2020-02-10 20:24:32,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:32,628 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:32,628 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:32,629 INFO L427 AbstractCegarLoop]: === Iteration 1305 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:32,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:32,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1103478019, now seen corresponding path program 1298 times [2020-02-10 20:24:32,629 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:32,629 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968414730] [2020-02-10 20:24:32,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:32,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:32,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968414730] [2020-02-10 20:24:32,959 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:32,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:32,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168193009] [2020-02-10 20:24:32,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:32,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:32,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:32,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:32,959 INFO L87 Difference]: Start difference. First operand 779 states and 3098 transitions. Second operand 10 states. [2020-02-10 20:24:33,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,093 INFO L93 Difference]: Finished difference Result 1202 states and 4232 transitions. [2020-02-10 20:24:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:33,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:33,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,096 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:24:33,096 INFO L226 Difference]: Without dead ends: 1183 [2020-02-10 20:24:33,097 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:33,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2020-02-10 20:24:33,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 776. [2020-02-10 20:24:33,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:24:33,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3090 transitions. [2020-02-10 20:24:33,118 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:33,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,118 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3090 transitions. [2020-02-10 20:24:33,118 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:33,118 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3090 transitions. [2020-02-10 20:24:33,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:33,119 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,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, 1, 1, 1] [2020-02-10 20:24:33,119 INFO L427 AbstractCegarLoop]: === Iteration 1306 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,119 INFO L82 PathProgramCache]: Analyzing trace with hash -2107900793, now seen corresponding path program 1299 times [2020-02-10 20:24:33,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571939378] [2020-02-10 20:24:33,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:33,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:33,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571939378] [2020-02-10 20:24:33,465 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:33,465 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:33,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290918278] [2020-02-10 20:24:33,465 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:33,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:33,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:33,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:33,466 INFO L87 Difference]: Start difference. First operand 776 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:33,601 INFO L93 Difference]: Finished difference Result 1196 states and 4220 transitions. [2020-02-10 20:24:33,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:33,601 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:33,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:33,604 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:24:33,605 INFO L226 Difference]: Without dead ends: 1184 [2020-02-10 20:24:33,605 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:33,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184 states. [2020-02-10 20:24:33,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184 to 779. [2020-02-10 20:24:33,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 779 states. [2020-02-10 20:24:33,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 3095 transitions. [2020-02-10 20:24:33,626 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 3095 transitions. Word has length 25 [2020-02-10 20:24:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:33,626 INFO L479 AbstractCegarLoop]: Abstraction has 779 states and 3095 transitions. [2020-02-10 20:24:33,626 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 3095 transitions. [2020-02-10 20:24:33,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:33,627 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:33,627 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:33,627 INFO L427 AbstractCegarLoop]: === Iteration 1307 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:33,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:33,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1113981123, now seen corresponding path program 1300 times [2020-02-10 20:24:33,628 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:33,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454751166] [2020-02-10 20:24:33,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:33,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:33,973 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454751166] [2020-02-10 20:24:33,973 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:33,973 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:33,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766542593] [2020-02-10 20:24:33,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:33,973 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:33,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:33,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:33,974 INFO L87 Difference]: Start difference. First operand 779 states and 3095 transitions. Second operand 10 states. [2020-02-10 20:24:34,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,116 INFO L93 Difference]: Finished difference Result 1198 states and 4221 transitions. [2020-02-10 20:24:34,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:34,117 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:34,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,120 INFO L225 Difference]: With dead ends: 1198 [2020-02-10 20:24:34,120 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:24:34,120 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:34,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:24:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 776. [2020-02-10 20:24:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2020-02-10 20:24:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 3087 transitions. [2020-02-10 20:24:34,141 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 3087 transitions. Word has length 25 [2020-02-10 20:24:34,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,141 INFO L479 AbstractCegarLoop]: Abstraction has 776 states and 3087 transitions. [2020-02-10 20:24:34,142 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:34,142 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 3087 transitions. [2020-02-10 20:24:34,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:34,143 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,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, 1, 1, 1] [2020-02-10 20:24:34,143 INFO L427 AbstractCegarLoop]: === Iteration 1308 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,143 INFO L82 PathProgramCache]: Analyzing trace with hash -2097397689, now seen corresponding path program 1301 times [2020-02-10 20:24:34,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418867710] [2020-02-10 20:24:34,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,494 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:34,494 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418867710] [2020-02-10 20:24:34,494 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,494 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:34,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266853824] [2020-02-10 20:24:34,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:34,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:34,495 INFO L87 Difference]: Start difference. First operand 776 states and 3087 transitions. Second operand 10 states. [2020-02-10 20:24:34,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:34,629 INFO L93 Difference]: Finished difference Result 1206 states and 4239 transitions. [2020-02-10 20:24:34,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:34,629 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:34,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:34,632 INFO L225 Difference]: With dead ends: 1206 [2020-02-10 20:24:34,632 INFO L226 Difference]: Without dead ends: 1190 [2020-02-10 20:24:34,633 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:34,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2020-02-10 20:24:34,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 781. [2020-02-10 20:24:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 781 states. [2020-02-10 20:24:34,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 3096 transitions. [2020-02-10 20:24:34,655 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 3096 transitions. Word has length 25 [2020-02-10 20:24:34,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:34,655 INFO L479 AbstractCegarLoop]: Abstraction has 781 states and 3096 transitions. [2020-02-10 20:24:34,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:34,655 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 3096 transitions. [2020-02-10 20:24:34,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:34,656 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:34,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, 1, 1, 1] [2020-02-10 20:24:34,656 INFO L427 AbstractCegarLoop]: === Iteration 1309 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:34,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:34,656 INFO L82 PathProgramCache]: Analyzing trace with hash -486456731, now seen corresponding path program 1302 times [2020-02-10 20:24:34,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:34,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827633002] [2020-02-10 20:24:34,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:34,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 20:24:34,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827633002] [2020-02-10 20:24:34,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:34,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:34,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990284177] [2020-02-10 20:24:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:34,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:34,998 INFO L87 Difference]: Start difference. First operand 781 states and 3096 transitions. Second operand 10 states. [2020-02-10 20:24:35,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:35,140 INFO L93 Difference]: Finished difference Result 1204 states and 4230 transitions. [2020-02-10 20:24:35,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:35,141 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:35,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:35,144 INFO L225 Difference]: With dead ends: 1204 [2020-02-10 20:24:35,144 INFO L226 Difference]: Without dead ends: 1182 [2020-02-10 20:24:35,145 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:35,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1182 states. [2020-02-10 20:24:35,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1182 to 773. [2020-02-10 20:24:35,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3080 transitions. [2020-02-10 20:24:35,166 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3080 transitions. Word has length 25 [2020-02-10 20:24:35,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:35,166 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3080 transitions. [2020-02-10 20:24:35,166 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3080 transitions. [2020-02-10 20:24:35,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:35,167 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:35,167 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:35,167 INFO L427 AbstractCegarLoop]: === Iteration 1310 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:35,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:35,168 INFO L82 PathProgramCache]: Analyzing trace with hash -950362079, now seen corresponding path program 1303 times [2020-02-10 20:24:35,168 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:35,168 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199572719] [2020-02-10 20:24:35,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:35,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:35,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199572719] [2020-02-10 20:24:35,503 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:35,503 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:35,503 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752168190] [2020-02-10 20:24:35,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:35,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:35,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:35,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:35,504 INFO L87 Difference]: Start difference. First operand 773 states and 3080 transitions. Second operand 10 states. [2020-02-10 20:24:35,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:35,670 INFO L93 Difference]: Finished difference Result 1190 states and 4203 transitions. [2020-02-10 20:24:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:35,670 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:35,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:35,673 INFO L225 Difference]: With dead ends: 1190 [2020-02-10 20:24:35,673 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:35,673 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:35,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:35,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 778. [2020-02-10 20:24:35,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:24:35,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3092 transitions. [2020-02-10 20:24:35,694 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3092 transitions. Word has length 25 [2020-02-10 20:24:35,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:35,694 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3092 transitions. [2020-02-10 20:24:35,694 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:35,694 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3092 transitions. [2020-02-10 20:24:35,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:35,695 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:35,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, 1, 1, 1] [2020-02-10 20:24:35,696 INFO L427 AbstractCegarLoop]: === Iteration 1311 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:35,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:35,696 INFO L82 PathProgramCache]: Analyzing trace with hash 660578879, now seen corresponding path program 1304 times [2020-02-10 20:24:35,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:35,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673047979] [2020-02-10 20:24:35,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:35,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673047979] [2020-02-10 20:24:36,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:36,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169229118] [2020-02-10 20:24:36,030 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:36,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:36,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:36,031 INFO L87 Difference]: Start difference. First operand 778 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:36,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,176 INFO L93 Difference]: Finished difference Result 1194 states and 4208 transitions. [2020-02-10 20:24:36,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:36,176 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:36,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,179 INFO L225 Difference]: With dead ends: 1194 [2020-02-10 20:24:36,180 INFO L226 Difference]: Without dead ends: 1175 [2020-02-10 20:24:36,180 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2020-02-10 20:24:36,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 775. [2020-02-10 20:24:36,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:36,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3085 transitions. [2020-02-10 20:24:36,201 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3085 transitions. Word has length 25 [2020-02-10 20:24:36,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,202 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3085 transitions. [2020-02-10 20:24:36,202 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3085 transitions. [2020-02-10 20:24:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:36,203 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,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, 1, 1, 1] [2020-02-10 20:24:36,203 INFO L427 AbstractCegarLoop]: === Iteration 1312 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1456708345, now seen corresponding path program 1305 times [2020-02-10 20:24:36,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705753275] [2020-02-10 20:24:36,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:36,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:36,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705753275] [2020-02-10 20:24:36,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:36,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:36,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267122277] [2020-02-10 20:24:36,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:36,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:36,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:36,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:36,547 INFO L87 Difference]: Start difference. First operand 775 states and 3085 transitions. Second operand 10 states. [2020-02-10 20:24:36,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:36,692 INFO L93 Difference]: Finished difference Result 1184 states and 4188 transitions. [2020-02-10 20:24:36,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:36,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:36,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:36,696 INFO L225 Difference]: With dead ends: 1184 [2020-02-10 20:24:36,696 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:24:36,696 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:24:36,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:24:36,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3088 transitions. [2020-02-10 20:24:36,717 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3088 transitions. Word has length 25 [2020-02-10 20:24:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:36,717 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3088 transitions. [2020-02-10 20:24:36,717 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:36,717 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3088 transitions. [2020-02-10 20:24:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:36,718 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:36,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, 1, 1, 1] [2020-02-10 20:24:36,718 INFO L427 AbstractCegarLoop]: === Iteration 1313 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:36,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:36,718 INFO L82 PathProgramCache]: Analyzing trace with hash 692088191, now seen corresponding path program 1306 times [2020-02-10 20:24:36,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:36,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545794499] [2020-02-10 20:24:36,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:36,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545794499] [2020-02-10 20:24:37,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:37,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007758808] [2020-02-10 20:24:37,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:37,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:37,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:37,062 INFO L87 Difference]: Start difference. First operand 777 states and 3088 transitions. Second operand 10 states. [2020-02-10 20:24:37,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,204 INFO L93 Difference]: Finished difference Result 1183 states and 4184 transitions. [2020-02-10 20:24:37,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:37,205 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:37,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,208 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:24:37,208 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:37,208 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:37,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:37,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 775. [2020-02-10 20:24:37,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:37,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:24:37,229 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:24:37,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,229 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:24:37,229 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:37,229 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:24:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:37,230 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,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, 1, 1, 1] [2020-02-10 20:24:37,230 INFO L427 AbstractCegarLoop]: === Iteration 1314 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash -1446205241, now seen corresponding path program 1307 times [2020-02-10 20:24:37,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160367666] [2020-02-10 20:24:37,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:37,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:37,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160367666] [2020-02-10 20:24:37,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:37,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:37,566 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249029829] [2020-02-10 20:24:37,566 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:37,566 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:37,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:37,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:37,567 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:24:37,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:37,714 INFO L93 Difference]: Finished difference Result 1192 states and 4202 transitions. [2020-02-10 20:24:37,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:37,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:37,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:37,717 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:37,717 INFO L226 Difference]: Without dead ends: 1176 [2020-02-10 20:24:37,717 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1176 states. [2020-02-10 20:24:37,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1176 to 777. [2020-02-10 20:24:37,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:37,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:24:37,738 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:24:37,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:37,738 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:24:37,738 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:37,738 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:24:37,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:37,739 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:37,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, 1, 1, 1] [2020-02-10 20:24:37,739 INFO L427 AbstractCegarLoop]: === Iteration 1315 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:37,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:37,740 INFO L82 PathProgramCache]: Analyzing trace with hash -908349663, now seen corresponding path program 1308 times [2020-02-10 20:24:37,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:37,740 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411096627] [2020-02-10 20:24:37,740 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:37,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,070 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411096627] [2020-02-10 20:24:38,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:38,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428110030] [2020-02-10 20:24:38,070 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:38,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:38,071 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:24:38,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:38,214 INFO L93 Difference]: Finished difference Result 1187 states and 4190 transitions. [2020-02-10 20:24:38,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:38,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:38,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:38,217 INFO L225 Difference]: With dead ends: 1187 [2020-02-10 20:24:38,217 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:24:38,217 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:38,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:24:38,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 773. [2020-02-10 20:24:38,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:38,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3078 transitions. [2020-02-10 20:24:38,238 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3078 transitions. Word has length 25 [2020-02-10 20:24:38,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:38,238 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3078 transitions. [2020-02-10 20:24:38,238 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:38,238 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3078 transitions. [2020-02-10 20:24:38,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:38,239 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:38,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, 1, 1, 1] [2020-02-10 20:24:38,239 INFO L427 AbstractCegarLoop]: === Iteration 1316 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:38,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:38,239 INFO L82 PathProgramCache]: Analyzing trace with hash -624765855, now seen corresponding path program 1309 times [2020-02-10 20:24:38,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:38,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479544970] [2020-02-10 20:24:38,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:38,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:38,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:38,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479544970] [2020-02-10 20:24:38,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:38,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:38,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310029519] [2020-02-10 20:24:38,594 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:38,595 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:38,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:38,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:38,595 INFO L87 Difference]: Start difference. First operand 773 states and 3078 transitions. Second operand 10 states. [2020-02-10 20:24:38,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:38,762 INFO L93 Difference]: Finished difference Result 1186 states and 4193 transitions. [2020-02-10 20:24:38,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:38,763 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:38,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:38,766 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:24:38,766 INFO L226 Difference]: Without dead ends: 1174 [2020-02-10 20:24:38,766 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:38,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2020-02-10 20:24:38,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 778. [2020-02-10 20:24:38,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2020-02-10 20:24:38,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 3090 transitions. [2020-02-10 20:24:38,788 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 3090 transitions. Word has length 25 [2020-02-10 20:24:38,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:38,788 INFO L479 AbstractCegarLoop]: Abstraction has 778 states and 3090 transitions. [2020-02-10 20:24:38,788 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:38,788 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 3090 transitions. [2020-02-10 20:24:38,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:38,789 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:38,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, 1, 1, 1] [2020-02-10 20:24:38,789 INFO L427 AbstractCegarLoop]: === Iteration 1317 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:38,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:38,789 INFO L82 PathProgramCache]: Analyzing trace with hash -1697851235, now seen corresponding path program 1310 times [2020-02-10 20:24:38,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:38,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633218922] [2020-02-10 20:24:38,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:39,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 20:24:39,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633218922] [2020-02-10 20:24:39,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:39,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:39,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336374406] [2020-02-10 20:24:39,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:39,137 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:39,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:39,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:39,137 INFO L87 Difference]: Start difference. First operand 778 states and 3090 transitions. Second operand 10 states. [2020-02-10 20:24:39,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,277 INFO L93 Difference]: Finished difference Result 1188 states and 4194 transitions. [2020-02-10 20:24:39,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:39,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:39,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,281 INFO L225 Difference]: With dead ends: 1188 [2020-02-10 20:24:39,281 INFO L226 Difference]: Without dead ends: 1171 [2020-02-10 20:24:39,281 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:39,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1171 states. [2020-02-10 20:24:39,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1171 to 775. [2020-02-10 20:24:39,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:39,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3083 transitions. [2020-02-10 20:24:39,302 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3083 transitions. Word has length 25 [2020-02-10 20:24:39,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,302 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3083 transitions. [2020-02-10 20:24:39,303 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:39,303 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3083 transitions. [2020-02-10 20:24:39,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:39,304 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,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, 1, 1, 1] [2020-02-10 20:24:39,304 INFO L427 AbstractCegarLoop]: === Iteration 1318 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,304 INFO L82 PathProgramCache]: Analyzing trace with hash 469325733, now seen corresponding path program 1311 times [2020-02-10 20:24:39,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651619067] [2020-02-10 20:24:39,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:39,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:39,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651619067] [2020-02-10 20:24:39,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:39,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:39,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743421056] [2020-02-10 20:24:39,670 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:39,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:39,671 INFO L87 Difference]: Start difference. First operand 775 states and 3083 transitions. Second operand 10 states. [2020-02-10 20:24:39,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:39,832 INFO L93 Difference]: Finished difference Result 1182 states and 4182 transitions. [2020-02-10 20:24:39,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:39,832 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:39,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:39,836 INFO L225 Difference]: With dead ends: 1182 [2020-02-10 20:24:39,836 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:39,836 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:39,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:39,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 777. [2020-02-10 20:24:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:39,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3086 transitions. [2020-02-10 20:24:39,857 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3086 transitions. Word has length 25 [2020-02-10 20:24:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:39,857 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3086 transitions. [2020-02-10 20:24:39,857 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3086 transitions. [2020-02-10 20:24:39,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:39,858 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:39,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, 1, 1, 1] [2020-02-10 20:24:39,858 INFO L427 AbstractCegarLoop]: === Iteration 1319 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:39,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:39,859 INFO L82 PathProgramCache]: Analyzing trace with hash -1676845027, now seen corresponding path program 1312 times [2020-02-10 20:24:39,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:39,859 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984501095] [2020-02-10 20:24:39,859 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,205 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984501095] [2020-02-10 20:24:40,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:40,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101135746] [2020-02-10 20:24:40,206 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:40,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:40,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:40,206 INFO L87 Difference]: Start difference. First operand 777 states and 3086 transitions. Second operand 10 states. [2020-02-10 20:24:40,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,374 INFO L93 Difference]: Finished difference Result 1181 states and 4178 transitions. [2020-02-10 20:24:40,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:40,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:40,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,378 INFO L225 Difference]: With dead ends: 1181 [2020-02-10 20:24:40,378 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:40,378 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:40,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:40,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 775. [2020-02-10 20:24:40,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:40,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:24:40,399 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:24:40,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,399 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:24:40,400 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:40,400 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:24:40,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:40,401 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,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, 1, 1, 1] [2020-02-10 20:24:40,401 INFO L427 AbstractCegarLoop]: === Iteration 1320 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,401 INFO L82 PathProgramCache]: Analyzing trace with hash 490331941, now seen corresponding path program 1313 times [2020-02-10 20:24:40,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487796238] [2020-02-10 20:24:40,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:40,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487796238] [2020-02-10 20:24:40,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:40,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:40,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099767693] [2020-02-10 20:24:40,741 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:40,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:40,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:40,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:40,742 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:24:40,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:40,886 INFO L93 Difference]: Finished difference Result 1186 states and 4188 transitions. [2020-02-10 20:24:40,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:40,886 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:40,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:40,889 INFO L225 Difference]: With dead ends: 1186 [2020-02-10 20:24:40,889 INFO L226 Difference]: Without dead ends: 1172 [2020-02-10 20:24:40,890 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:40,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1172 states. [2020-02-10 20:24:40,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1172 to 777. [2020-02-10 20:24:40,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:24:40,911 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:24:40,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:40,911 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:24:40,911 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:40,911 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:24:40,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:40,912 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:40,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, 1, 1, 1] [2020-02-10 20:24:40,912 INFO L427 AbstractCegarLoop]: === Iteration 1321 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:40,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:40,912 INFO L82 PathProgramCache]: Analyzing trace with hash -582753439, now seen corresponding path program 1314 times [2020-02-10 20:24:40,912 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:40,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028327290] [2020-02-10 20:24:40,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028327290] [2020-02-10 20:24:41,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:41,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74262852] [2020-02-10 20:24:41,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:41,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:41,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:41,265 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:24:41,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,417 INFO L93 Difference]: Finished difference Result 1183 states and 4180 transitions. [2020-02-10 20:24:41,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:41,417 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:41,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,421 INFO L225 Difference]: With dead ends: 1183 [2020-02-10 20:24:41,421 INFO L226 Difference]: Without dead ends: 1168 [2020-02-10 20:24:41,421 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:41,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2020-02-10 20:24:41,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 773. [2020-02-10 20:24:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2020-02-10 20:24:41,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 3076 transitions. [2020-02-10 20:24:41,442 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 3076 transitions. Word has length 25 [2020-02-10 20:24:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:41,442 INFO L479 AbstractCegarLoop]: Abstraction has 773 states and 3076 transitions. [2020-02-10 20:24:41,442 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 3076 transitions. [2020-02-10 20:24:41,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:41,443 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:41,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, 1, 1, 1] [2020-02-10 20:24:41,443 INFO L427 AbstractCegarLoop]: === Iteration 1322 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash 1311771327, now seen corresponding path program 1315 times [2020-02-10 20:24:41,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:41,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519726343] [2020-02-10 20:24:41,444 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:41,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:41,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:41,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519726343] [2020-02-10 20:24:41,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:41,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:41,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122284214] [2020-02-10 20:24:41,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:41,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:41,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:41,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:41,785 INFO L87 Difference]: Start difference. First operand 773 states and 3076 transitions. Second operand 10 states. [2020-02-10 20:24:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:41,932 INFO L93 Difference]: Finished difference Result 1202 states and 4227 transitions. [2020-02-10 20:24:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:41,932 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:41,935 INFO L225 Difference]: With dead ends: 1202 [2020-02-10 20:24:41,936 INFO L226 Difference]: Without dead ends: 1186 [2020-02-10 20:24:41,936 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:41,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2020-02-10 20:24:41,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 780. [2020-02-10 20:24:41,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:24:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3092 transitions. [2020-02-10 20:24:41,957 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3092 transitions. Word has length 25 [2020-02-10 20:24:41,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:41,957 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3092 transitions. [2020-02-10 20:24:41,957 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:41,957 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3092 transitions. [2020-02-10 20:24:41,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:41,958 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:41,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, 1, 1, 1] [2020-02-10 20:24:41,958 INFO L427 AbstractCegarLoop]: === Iteration 1323 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:41,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:41,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1372255011, now seen corresponding path program 1316 times [2020-02-10 20:24:41,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:41,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399214936] [2020-02-10 20:24:41,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:41,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399214936] [2020-02-10 20:24:42,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:42,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033005992] [2020-02-10 20:24:42,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:42,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:42,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:42,306 INFO L87 Difference]: Start difference. First operand 780 states and 3092 transitions. Second operand 10 states. [2020-02-10 20:24:42,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:42,495 INFO L93 Difference]: Finished difference Result 1200 states and 4218 transitions. [2020-02-10 20:24:42,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:42,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:42,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:42,498 INFO L225 Difference]: With dead ends: 1200 [2020-02-10 20:24:42,498 INFO L226 Difference]: Without dead ends: 1181 [2020-02-10 20:24:42,498 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:42,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2020-02-10 20:24:42,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 775. [2020-02-10 20:24:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:42,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3081 transitions. [2020-02-10 20:24:42,519 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3081 transitions. Word has length 25 [2020-02-10 20:24:42,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:42,519 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3081 transitions. [2020-02-10 20:24:42,519 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3081 transitions. [2020-02-10 20:24:42,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:42,520 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:42,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, 1, 1, 1] [2020-02-10 20:24:42,520 INFO L427 AbstractCegarLoop]: === Iteration 1324 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:42,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1889104381, now seen corresponding path program 1317 times [2020-02-10 20:24:42,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:42,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708775976] [2020-02-10 20:24:42,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:42,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:42,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708775976] [2020-02-10 20:24:42,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:42,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:42,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664227351] [2020-02-10 20:24:42,855 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:42,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:42,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:42,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:42,855 INFO L87 Difference]: Start difference. First operand 775 states and 3081 transitions. Second operand 10 states. [2020-02-10 20:24:42,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:42,998 INFO L93 Difference]: Finished difference Result 1196 states and 4210 transitions. [2020-02-10 20:24:42,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:42,998 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:42,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,002 INFO L225 Difference]: With dead ends: 1196 [2020-02-10 20:24:43,002 INFO L226 Difference]: Without dead ends: 1180 [2020-02-10 20:24:43,002 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1180 states. [2020-02-10 20:24:43,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1180 to 777. [2020-02-10 20:24:43,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3084 transitions. [2020-02-10 20:24:43,024 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3084 transitions. Word has length 25 [2020-02-10 20:24:43,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,024 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3084 transitions. [2020-02-10 20:24:43,024 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:43,024 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3084 transitions. [2020-02-10 20:24:43,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:43,025 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,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, 1, 1, 1] [2020-02-10 20:24:43,025 INFO L427 AbstractCegarLoop]: === Iteration 1325 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1351248803, now seen corresponding path program 1318 times [2020-02-10 20:24:43,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199937404] [2020-02-10 20:24:43,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:43,357 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199937404] [2020-02-10 20:24:43,357 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,357 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:43,357 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587975580] [2020-02-10 20:24:43,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:43,358 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:43,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:43,358 INFO L87 Difference]: Start difference. First operand 777 states and 3084 transitions. Second operand 10 states. [2020-02-10 20:24:43,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:43,506 INFO L93 Difference]: Finished difference Result 1191 states and 4198 transitions. [2020-02-10 20:24:43,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:43,507 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:43,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:43,510 INFO L225 Difference]: With dead ends: 1191 [2020-02-10 20:24:43,510 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:43,510 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:43,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 775. [2020-02-10 20:24:43,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2020-02-10 20:24:43,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 3079 transitions. [2020-02-10 20:24:43,531 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 3079 transitions. Word has length 25 [2020-02-10 20:24:43,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:43,531 INFO L479 AbstractCegarLoop]: Abstraction has 775 states and 3079 transitions. [2020-02-10 20:24:43,531 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:43,532 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 3079 transitions. [2020-02-10 20:24:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:43,532 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:43,533 INFO L415 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-02-10 20:24:43,533 INFO L427 AbstractCegarLoop]: === Iteration 1326 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:43,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:43,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1878601277, now seen corresponding path program 1319 times [2020-02-10 20:24:43,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:43,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210437157] [2020-02-10 20:24:43,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:43,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:43,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 20:24:43,873 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210437157] [2020-02-10 20:24:43,873 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:43,874 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:43,874 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434242361] [2020-02-10 20:24:43,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:43,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:43,874 INFO L87 Difference]: Start difference. First operand 775 states and 3079 transitions. Second operand 10 states. [2020-02-10 20:24:44,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,028 INFO L93 Difference]: Finished difference Result 1192 states and 4200 transitions. [2020-02-10 20:24:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:44,028 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:44,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,031 INFO L225 Difference]: With dead ends: 1192 [2020-02-10 20:24:44,031 INFO L226 Difference]: Without dead ends: 1178 [2020-02-10 20:24:44,031 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:44,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2020-02-10 20:24:44,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 777. [2020-02-10 20:24:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:44,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3082 transitions. [2020-02-10 20:24:44,052 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3082 transitions. Word has length 25 [2020-02-10 20:24:44,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:44,052 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3082 transitions. [2020-02-10 20:24:44,052 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:44,052 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3082 transitions. [2020-02-10 20:24:44,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:44,053 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:44,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, 1, 1, 1] [2020-02-10 20:24:44,053 INFO L427 AbstractCegarLoop]: === Iteration 1327 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:44,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:44,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1343280639, now seen corresponding path program 1320 times [2020-02-10 20:24:44,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:44,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009966705] [2020-02-10 20:24:44,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:44,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,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 20:24:44,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009966705] [2020-02-10 20:24:44,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:44,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607029619] [2020-02-10 20:24:44,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:44,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:44,400 INFO L87 Difference]: Start difference. First operand 777 states and 3082 transitions. Second operand 10 states. [2020-02-10 20:24:44,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:44,550 INFO L93 Difference]: Finished difference Result 1189 states and 4192 transitions. [2020-02-10 20:24:44,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:44,551 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:44,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:44,554 INFO L225 Difference]: With dead ends: 1189 [2020-02-10 20:24:44,554 INFO L226 Difference]: Without dead ends: 1170 [2020-02-10 20:24:44,554 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:44,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2020-02-10 20:24:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 769. [2020-02-10 20:24:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2020-02-10 20:24:44,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 3068 transitions. [2020-02-10 20:24:44,575 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 3068 transitions. Word has length 25 [2020-02-10 20:24:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:44,575 INFO L479 AbstractCegarLoop]: Abstraction has 769 states and 3068 transitions. [2020-02-10 20:24:44,575 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:44,575 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 3068 transitions. [2020-02-10 20:24:44,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:44,576 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:44,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, 1, 1, 1] [2020-02-10 20:24:44,576 INFO L427 AbstractCegarLoop]: === Iteration 1328 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:44,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:44,576 INFO L82 PathProgramCache]: Analyzing trace with hash -984451491, now seen corresponding path program 1321 times [2020-02-10 20:24:44,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:44,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593790784] [2020-02-10 20:24:44,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:44,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:44,958 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:44,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593790784] [2020-02-10 20:24:44,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:44,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:44,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780298511] [2020-02-10 20:24:44,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:44,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:44,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:44,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:44,959 INFO L87 Difference]: Start difference. First operand 769 states and 3068 transitions. Second operand 10 states. [2020-02-10 20:24:45,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:45,113 INFO L93 Difference]: Finished difference Result 1226 states and 4316 transitions. [2020-02-10 20:24:45,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:45,114 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:45,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:45,117 INFO L225 Difference]: With dead ends: 1226 [2020-02-10 20:24:45,117 INFO L226 Difference]: Without dead ends: 1211 [2020-02-10 20:24:45,118 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2020-02-10 20:24:45,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 780. [2020-02-10 20:24:45,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 780 states. [2020-02-10 20:24:45,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 780 states to 780 states and 3109 transitions. [2020-02-10 20:24:45,141 INFO L78 Accepts]: Start accepts. Automaton has 780 states and 3109 transitions. Word has length 25 [2020-02-10 20:24:45,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,141 INFO L479 AbstractCegarLoop]: Abstraction has 780 states and 3109 transitions. [2020-02-10 20:24:45,141 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:45,141 INFO L276 IsEmpty]: Start isEmpty. Operand 780 states and 3109 transitions. [2020-02-10 20:24:45,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:45,142 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,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, 1, 1, 1] [2020-02-10 20:24:45,142 INFO L427 AbstractCegarLoop]: === Iteration 1329 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,143 INFO L82 PathProgramCache]: Analyzing trace with hash 626489467, now seen corresponding path program 1322 times [2020-02-10 20:24:45,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2628303] [2020-02-10 20:24:45,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:45,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:45,515 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2628303] [2020-02-10 20:24:45,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:45,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:45,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640178687] [2020-02-10 20:24:45,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:45,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:45,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:45,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:45,516 INFO L87 Difference]: Start difference. First operand 780 states and 3109 transitions. Second operand 10 states. [2020-02-10 20:24:45,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:45,660 INFO L93 Difference]: Finished difference Result 1223 states and 4307 transitions. [2020-02-10 20:24:45,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:45,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:45,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:45,663 INFO L225 Difference]: With dead ends: 1223 [2020-02-10 20:24:45,663 INFO L226 Difference]: Without dead ends: 1208 [2020-02-10 20:24:45,663 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:45,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1208 states. [2020-02-10 20:24:45,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1208 to 777. [2020-02-10 20:24:45,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2020-02-10 20:24:45,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 3101 transitions. [2020-02-10 20:24:45,684 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 3101 transitions. Word has length 25 [2020-02-10 20:24:45,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:45,684 INFO L479 AbstractCegarLoop]: Abstraction has 777 states and 3101 transitions. [2020-02-10 20:24:45,684 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:45,684 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 3101 transitions. [2020-02-10 20:24:45,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:45,685 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:45,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, 1, 1, 1] [2020-02-10 20:24:45,685 INFO L427 AbstractCegarLoop]: === Iteration 1330 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:45,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:45,685 INFO L82 PathProgramCache]: Analyzing trace with hash 1710077951, now seen corresponding path program 1323 times [2020-02-10 20:24:45,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:45,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870198994] [2020-02-10 20:24:45,686 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:46,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870198994] [2020-02-10 20:24:46,052 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:46,052 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:46,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027810449] [2020-02-10 20:24:46,052 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:46,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:46,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:46,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:46,053 INFO L87 Difference]: Start difference. First operand 777 states and 3101 transitions. Second operand 10 states. [2020-02-10 20:24:46,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-02-10 20:24:46,232 INFO L93 Difference]: Finished difference Result 1233 states and 4330 transitions. [2020-02-10 20:24:46,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-02-10 20:24:46,232 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2020-02-10 20:24:46,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-02-10 20:24:46,235 INFO L225 Difference]: With dead ends: 1233 [2020-02-10 20:24:46,235 INFO L226 Difference]: Without dead ends: 1218 [2020-02-10 20:24:46,236 INFO L633 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2020-02-10 20:24:46,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1218 states. [2020-02-10 20:24:46,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1218 to 783. [2020-02-10 20:24:46,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 783 states. [2020-02-10 20:24:46,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 3112 transitions. [2020-02-10 20:24:46,257 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 3112 transitions. Word has length 25 [2020-02-10 20:24:46,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-02-10 20:24:46,257 INFO L479 AbstractCegarLoop]: Abstraction has 783 states and 3112 transitions. [2020-02-10 20:24:46,257 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-02-10 20:24:46,257 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 3112 transitions. [2020-02-10 20:24:46,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-02-10 20:24:46,258 INFO L407 BasicCegarLoop]: Found error trace [2020-02-10 20:24:46,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, 1, 1, 1] [2020-02-10 20:24:46,258 INFO L427 AbstractCegarLoop]: === Iteration 1331 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr7INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr6INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr5INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONASSERT, ULTIMATE.startErr4INUSE_VIOLATION]=== [2020-02-10 20:24:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-02-10 20:24:46,259 INFO L82 PathProgramCache]: Analyzing trace with hash 636992571, now seen corresponding path program 1324 times [2020-02-10 20:24:46,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-02-10 20:24:46,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925335040] [2020-02-10 20:24:46,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-02-10 20:24:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-02-10 20:24:46,633 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-02-10 20:24:46,634 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925335040] [2020-02-10 20:24:46,634 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-02-10 20:24:46,634 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-02-10 20:24:46,634 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742792070] [2020-02-10 20:24:46,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-02-10 20:24:46,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-02-10 20:24:46,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-02-10 20:24:46,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-02-10 20:24:46,634 INFO L87 Difference]: Start difference. First operand 783 states and 3112 transitions. Second operand 10 states. Received shutdown request... [2020-02-10 20:24:46,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-02-10 20:24:46,650 WARN L544 AbstractCegarLoop]: Verification canceled [2020-02-10 20:24:46,654 WARN L227 ceAbstractionStarter]: Timeout [2020-02-10 20:24:46,655 INFO L202 PluginConnector]: Adding new model example_8.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.02 08:24:46 BasicIcfg [2020-02-10 20:24:46,655 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-02-10 20:24:46,656 INFO L168 Benchmark]: Toolchain (without parser) took 765015.36 ms. Allocated memory was 137.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 119.9 MB in the beginning and 730.1 MB in the end (delta: -610.2 MB). Peak memory consumption was 490.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,656 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,656 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.32 ms. Allocated memory is still 137.9 MB. Free memory was 119.6 MB in the beginning and 118.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,656 INFO L168 Benchmark]: Boogie Preprocessor took 20.72 ms. Allocated memory is still 137.9 MB. Free memory was 117.8 MB in the beginning and 116.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,657 INFO L168 Benchmark]: RCFGBuilder took 366.43 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 103.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,657 INFO L168 Benchmark]: TraceAbstraction took 764586.85 ms. Allocated memory was 137.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.9 MB in the beginning and 730.1 MB in the end (delta: -627.2 MB). Peak memory consumption was 473.3 MB. Max. memory is 7.1 GB. [2020-02-10 20:24:46,658 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 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 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 35.32 ms. Allocated memory is still 137.9 MB. Free memory was 119.6 MB in the beginning and 118.0 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.72 ms. Allocated memory is still 137.9 MB. Free memory was 117.8 MB in the beginning and 116.6 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.43 ms. Allocated memory is still 137.9 MB. Free memory was 116.6 MB in the beginning and 103.3 MB in the end (delta: 13.3 MB). Peak memory consumption was 13.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 764586.85 ms. Allocated memory was 137.9 MB in the beginning and 1.2 GB in the end (delta: 1.1 GB). Free memory was 102.9 MB in the beginning and 730.1 MB in the end (delta: -627.2 MB). Peak memory consumption was 473.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 0.9s, 68 ProgramPointsBefore, 59 ProgramPointsAfterwards, 99 TransitionsBefore, 90 TransitionsAfterwards, 1904 CoEnabledTransitionPairs, 2 FixpointIterations, 1 TrivialSequentialCompositions, 8 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 0 ConcurrentYvCompositions, 0 ChoiceCompositions, 504 VarBasedMoverChecksPositive, 0 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 532 CheckedPairsTotal, 9 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 29]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 29). Cancelled while BasicCegarLoop was constructing difference of abstraction (783states) and FLOYD_HOARE automaton (currently 3 states, 10 states before enhancement),while ReachableStatesComputation was computing reachable states (17 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 44 locations, 1 error locations. Started 1 CEGAR loops. Result: TIMEOUT, OverallTime: 764.3s, OverallIterations: 1331, TraceHistogramMax: 1, AutomataDifference: 206.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.8s, HoareTripleCheckerStatistics: 119127 SDtfs, 175933 SDslu, 304397 SDs, 0 SdLazy, 90785 SolverSat, 21 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 87.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13260 GetRequests, 1338 SyntacticMatches, 0 SemanticMatches, 11922 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7944 ImplicationChecksByTransitivity, 578.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6818occurred 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: 31.6s AutomataMinimizationTime, 1330 MinimizatonAttempts, 695749 StatesRemovedByMinimization, 1323 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 512.3s InterpolantComputationTime, 33275 NumberOfCodeBlocks, 33275 NumberOfCodeBlocksAsserted, 1331 NumberOfCheckSat, 31944 ConstructedInterpolants, 0 QuantifiedInterpolants, 22314192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1331 InterpolantComputations, 1331 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